static int t, n;
static long[] dp;
static BufferedReader br;
static StringBuilder sb = new StringBuilder();

public static void main(String[] args) throws IOException {
    br = new BufferedReader(new InputStreamReader(System.in));
    t = Integer.parseInt(br.readLine());

    pro();

    for (int i = 0; i < t; i++) {
        input();
        sb.append(dp[n]).append("\n");
    }

    System.out.println(sb);
}

static void input() throws IOException {

    br = new BufferedReader(new InputStreamReader(System.in));
    n = Integer.parseInt(br.readLine());

}

static void pro() {

    dp = new long[100001];
    dp[0] = 1;
    dp[1] = 1;
    dp[2] = 2;
    dp[3] = 2;
    dp[4] = 3;
    dp[5] = 3;
    for (int i = 6; i < 100001; i++) {
        dp[i] = (dp[i - 2] + dp[i - 4] + dp[i - 6]) % 1000000009;
    }

}

import java.io.*;
import java.util.*;

public class Main {
    static StringBuilder sb = new StringBuilder();
    static FastReader scan = new FastReader();

    static int N, R, Q;
    static ArrayList<Integer>[] adj;
    static int[] V, parent;


    static void input() {
        N = scan.nextInt();
        R = scan.nextInt();
        Q = scan.nextInt();
        adj = new ArrayList[N+1];
        for (int i = 0; i <= N; i++) adj[i] = new ArrayList<>();
        for (int i = 0; i < N; i++){
            int u = scan.nextInt(), v = scan.nextInt();
            adj[u].add(v);
            adj[v].add(u);
        }

        V = new int[N+1];
        parent = new int[N + 1];
    }

    static void dfs(int x, int par){
// 정점과 연결된 간선의 갯수가 하나, 즉 leaf노드 일경우?? 정점의 갯수가 1개임을 나타냄
        if (adj[x].size() == 1){
            V[x] = 1;
        }
        for (int y : adj[x]){
            if (y == par) continue;
            parent[y] = x;
            dfs(y, x);
            V[x] += V[y];
        }
    }

    static void pro(){
        dfs(R, -1);
        for (int i = 0; i < Q; i++){
            int x  = scan.nextInt();
            sb.append(V[x]).append('\n');
        }
        System.out.println(sb);
    }

    public static void main(String[] args) {
        input();
        pro();
    }


    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        public FastReader(String s) throws FileNotFoundException {
            br = new BufferedReader(new FileReader(new File(s)));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
}

//다른 풀이
if ( A[L] + A[R] + target > 0)  

//강사님 풀이
if( A[L] + A[R] > target )

3
1033 8179
1373 8017
1033 1033

    int pivot = dataList.get(0);

    ArrayList<Integer> leftArr = new ArrayList<Integer>();
    ArrayList<Integer> rightArr = new ArrayList<Integer>();

    for(int i = 1; i < dataList.size(); i++) {
        if(pivot > dataList.get(i)) {
            leftArr.add(dataList.get(i));
        } else {
            rightArr.add(dataList.get(i));
        }
    }
    ArrayList<Integer> sortList = new ArrayList<Integer>();
    sortList.addAll(sortFunc(leftArr));
    sortList.addAll(Arrays.asList(pivot));
    sortList.addAll(sortFunc(rightArr));

    return sortList;
}

public static void main(String[] args) {
    ArrayList<Integer> dataList = new ArrayList<>();
    MergeSort mergeSort = new MergeSort();
    for(int i = 0; i < 100; i++) {
        dataList.add((int)(Math.random() * 100));
    }
    System.out.println(mergeSort.sortFunc(dataList));
}

static int n;
static int ans=0;
static int[][] point;

public static void main(String[] args) {
	
	Scanner sc = new Scanner(System.in);
	
	n=sc.nextInt();
	
	point=new int[n][2];
	
	for(int i=0;i<n;i++) {
		
		point[i][0]=sc.nextInt();
		point[i][1]=sc.nextInt();
		
	}
	
	pro();
	
	System.out.println(ans);
	
	// TODO Auto-generated method stub

}

static void pro() {
	
	for(int idx=0;idx<n;idx++) {
		//흰색
		if(point[idx][1]==1) {
			
			int tmpans=Integer.MAX_VALUE;
			for(int i=0;i<n;i++) {
				if(point[i][1]==1) {
					if(Math.abs(point[i][0]-point[idx][0])==0) continue;
					tmpans=Math.min(tmpans, Math.abs(point[i][0]-point[idx][0]));
				}
			}
			if(tmpans==Integer.MAX_VALUE) continue;
			
			ans+=tmpans;
			
		}
		//검은색
		else {
			
			int tmpans=Integer.MAX_VALUE;
			for(int i=0;i<n;i++) {
				if(point[i][1]==2) {
					if(Math.abs(point[i][0]-point[idx][0])==0) continue;
					tmpans=Math.min(tmpans, Math.abs(point[i][0]-point[idx][0]));
				}
			}
			
			if(tmpans==Integer.MAX_VALUE) continue;
			
			ans+=tmpans;
		}
	}
	
}

static int N,M;
static int [] lessons;

static void input(){
    FastScan fc = new FastScan();

    N = fc.nextInt();
    M = fc.nextInt();

    lessons = new int [N];
    for(int i =0; i < N; i++) {
        lessons[i] = fc.nextInt();
    }
}

static boolean determination(int len) {
    int cnt = 1, sum = 0;
    for (int i = 0; i < N; i++) {
        if (sum + lessons[i] > len) {
            cnt++;
            sum = lessons[i];
        } else {
            sum += lessons[i];
        }
    }
    return cnt <= M;
}

static void solve(){
    Arrays.sort(lessons);

    int L = lessons[N-1];
    int R = 1000000000;
    int result = 0;

    while(L<=R) {
        int mid = (L+R) / 2;
        if(determination(mid)) {
            result = mid;
            R = mid - 1;
        }else {
            L = mid + 1;
        }
    }

    System.out.println(result);
}

public static void main(String[] args) {
    input();
    solve();
}


static class FastScan{
    BufferedReader br;
    StringTokenizer st;

    public FastScan(){
        br = new BufferedReader(new InputStreamReader(System.in));
    }

    public FastScan(String name) throws FileNotFoundException {
        br = new BufferedReader(new FileReader(name));
    }

    String next() {
        while (st == null || !st.hasMoreElements()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }

    int nextInt() {
        return Integer.parseInt(next());
    }

    long nextLong() {
        return Long.parseLong(next());
    }

    double nextDouble() {
        return Double.parseDouble(next());
    }

    String nextLine() {
        String str = "";
        try {
            str = br.readLine();
        } catch (IOException e) {
            e.printStackTrace();
        }
        return str;
    }
}

while (true) {

//            System.out.println(s + " " + e);
            //if와 else if 구분 잘해야함
            //sum < M할 때, sum += arr[e++] 해주면서 sum == K가 될 수 있음
            if(e == N) break;

            if(sum >= M){
                sum -= arr[s];
                s++;
            }
            else {
                sum += arr[e++];
            }

            if(sum == M){
                cnt++;
            }
            //왜 e == N일떄 멈춰도되나?
            //e가 잇는상태에서 s가 계속 가면서 답이 될 수 있지않을까?
            //절대 아니다. 왜냐하면 이미 Sum보다 작으면서 e == N이면
            //s가 늘어난다하면 당연히 뺄텐데 여기서 이미 sum보다 작은데 뺴면 더 작아지니까 답이 안됨 어차피

        }

 while (true) {

            //if와 else if 구분 잘해야함
            //sum < M할 때, sum += arr[e++] 해주면서 sum == K가 될 수 있음

            if(sum >= M){
                sum -= arr[s];
                s++;
            }
            else if(e == N){
                break;
            }

            else{
                sum += arr[e++];
            }
            
            if(sum == M){
                cnt++;
            }
        }

public class Main {
    static int atoi(String str){
        return Integer.parseInt(str);
    }
    static int rel[][];
    static int arr[][];
    static boolean visit[];
    static boolean recur[];
    static int N;
    public static void main(String args[]) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        N = atoi(br.readLine());
        rel = new int[N+1][N+1];
        arr = new int[N+1][N+1];

        for (int i = 1; i <= N; i++) {
            StringTokenizer st = new StringTokenizer(br.readLine());
            for (int j = 1; j <= N; j++) {
                arr[i][j] = atoi(st.nextToken());
            }
        }

        for (int i = 1; i <= N; i++) {
            //start시점마다 visit배열을 초기화
            visit = new boolean[N + 1];
            recur = new boolean[N + 1];
            dfs(i);
            for (int j = 1; j <= N; j++) {
                if(recur[j]){ //recur 대신에 visit
                    rel[i][j] = 1;
                }
            }
        }

        for (int i = 1; i <= N; i++) {
            for (int j = 1; j <= N; j++) {
                System.out.print(rel[i][j] + " ");
            }
            System.out.println();
        }
    }
    static void dfs(int start){
        //dfs경로를 감
        visit[start] = true;

        for (int i = 1; i <= N; i++) {
            if(visit[i]) continue;
            if(arr[start][i] == 0) continue;
            recur[i] = true;
            dfs(i);
        }
    }
}

for (int i = 1; i <= N; i++) {
            //start시점마다 visit배열을 초기화
            visit = new boolean[N + 1];
            for (int j = 1; j <= N; j++) {
                if(arr[i][j] == 1 && !visit[j])
                    dfs(i, j);
            }
}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {
    static int N;
    static char ch[];
    static int possible[] = new int[26];
    //값이 0 이면 단어가 없는거고 1 이상이면 있는거
    //boolean 으로 하면 안됨 -> 왜 ? -> b가 여러개 있을수도
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        N = Integer.parseInt(br.readLine());
        String str = br.readLine();

        ch = new char[str.length() + 1];

        for (int i = 0; i < str.length(); i++) {
            ch[i + 1] = str.charAt(i);
        }

        pro();
    }

    static void pro() {
        int e = 0, len = 0, cnt = 0;

        for (int s = 1; s < ch.length; s++) {
            if(s >= 2 && possible[ch[s-1] - 'a'] > 0){
                possible[ch[s-1] - 'a']--;
                if(possible[ch[s - 1] - 'a'] == 0) cnt--;
                //해당 알파벳의 개수가 0이되야 cnt를 뺄 수 있음.
            }

            while(e+1<ch.length && cnt < N){
                if(possible[ch[++e] - 'a'] == 0){
                    cnt++;
                    possible[ch[e] - 'a']++;
                }
                //N이 cnt와 같은 순간에 끝냄

            }

            //N이 같을 때, 뒤 알파벳의 개수가 > 0인 경우는 e를 늘려도 됨됨
            whle (e + 1 < ch.length && possible[ch[e+1] - 'a'] > 0) {
                ++e;
                possible[ch[e] - 'a']++;
            }

            len = Math.max(len, e - s + 1);
//            System.out.println(s + " " + e);
        }

        System.out.println(len);
    }
}

static int n, ans = 0;
static int[][] dp;

public static void main(String[] args) throws IOException {
    input();
    pro();

    System.out.println(ans);
}

static void input() throws IOException {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    n = Integer.parseInt(br.readLine());

    dp = new int[n + 1][10];
}

static void pro() {

    // n=1인 경우
    for (int last = 1; last <= 9; last++) {
        dp[1][last] = 1;
    }
    // 뒤가 0으로 끝나는 경우
    for (int len = 1; len <= n; len++) {
        dp[len][0] = 1;
    }

    if (n > 1) {
        for (int len = 2; len <= n; len++) {
            for (int last = 1; last <= 9; last++) {
                int tmpans = fac(last + len - 1) / fac(last) / fac(len - 1);
                dp[len][last] = tmpans % 10007;
            }
        }
    }

    for (int i = 0; i <= 9; i++) {
        ans += dp[n][i];
    }

}

static int fac(int k) {
    if (k == 1) {
        return 1;
    }
    return k * fac(k - 1);
}

import java.io.*;

public class Main{
    static int atoi(String str) {
        return Integer.parseInt(str);
    }
    public static void main(String[] args) throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        int size = atoi(br.readLine());
        int arr[] = new int[size];

        for (int i = 0; i < size; i++) {
            arr[i] = atoi(br.readLine());
        }

        int dp[][] = new int[size][2];

        dp[0][0] = 0;
        dp[0][1] = arr[0];

        if (size >= 1) {
            dp[1][0] = arr[1];
            dp[1][1] = arr[0] + arr[1];
        }

        for (int i = 2; i < size; i++) {
            dp[i][0] = Math.max(dp[i - 2][0], dp[i - 2][1]) + arr[i];
            dp[i][1] = dp[i - 1][0] + arr[i];
        }

        System.out.println(Math.max(dp[size-1][0], dp[size-1][1]));
    }
}

import java.io.*;
import java.util.*;

public class BOJ1637 {
    static StringBuilder sb = new StringBuilder();
    static FastReader scan = new FastReader();

    static int N, maxint, ans, total;
    static int[] A,B,C;

    static void input() {
        N = scan.nextInt();
        maxint = Integer.MIN_VALUE;
        A = new int[N];
        B = new int[N];
        C = new int[N];
        for (int i = 0; i < N; i++){
            A[i] = scan.nextInt();
            B[i] = scan.nextInt();
            C[i] = scan.nextInt();
            maxint = Math.max(maxint,B[i]);
        }
    }

    static void pro() {
        int left = 1;
        int right = maxint;
        boolean noodd = true;
        while (right >= left) {
            int mid = (left + right) / 2;
            int cnt = 0;
            for (int i = 0; i < N; i++) {
                if(A[i] > mid) continue;
                if (B[i] >= mid) cnt += (mid - A[i]) / C[i];
                else cnt += (B[i] - A[i]) / C[i] + 1;

            }
            if (cnt % 2 == 0) {
                ans = mid;
                left = mid + 1;
            }
            
            else {
                right = mid - 1;
                noodd = false;
            }
        }

        if (noodd) sb.append("NOTHING");
        else{
            for (int i = 0; i < N; i++) {
                if ((ans <= B[i] && ans >= A[i]) && ((ans - A[i]) % C[i] == 0)) total++;
            }
            sb.append(ans).append(' ').append(total);
        }
    }
    
    public static void main(String[] args) {
        input();
        pro();
        System.out.println(sb);
    }


    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        public FastReader(String s) throws FileNotFoundException {
            br = new BufferedReader(new FileReader(new File(s)));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
}