200 查找树中元素

import java.util.*;
import java.nio.charset.StandardCharsets;
import java.io.*;
public class Main85 {
	public static int[] parse(String str) {
		ByteArrayInputStream stream = new ByteArrayInputStream(str.getBytes(StandardCharsets.UTF_8));
		ArrayList<Integer> l = new ArrayList<>();
		Scanner input = new Scanner(stream);	
		while(input.hasNext()) {//*
			l.add(input.nextInt());
		}
		return l.stream().mapToInt(it -> it).toArray();
	}
	public static String dQuery(int x, int y, int[][] matrix) {
		if(!(x >= 0 && y >= 0)) return "{}";
		ArrayList<Integer> list = new ArrayList<>();
		compute(x, 0, matrix, list);
		if(list.size() <= y) return "{}";
		String res = "";
		res += "{" + list.get(y) + "}";
		return res;
	}
	public static void compute(int a, int index, int[][] matrix, ArrayList<Integer> list) {
		int[] N = matrix[index];
		if(a == 0) {
			list.add(N[0]);
			return;
		}
		if(N.length == 1) return;
		for(int j = 1; j < N.length; j++) {
			int temp = N[j];
			compute(a - 1, temp, matrix, list);
		}
	}
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		while(in.hasNextLine()) {
			int n = Integer.valueOf(in.nextLine());//节点个数
			int[][] matrix = new int[n][];
			for(int k = 0; k < n; k++) {
				matrix[k] = parse(in.nextLine());
			}
			String[] str = in.nextLine().split(" ");
			int x = Integer.parseInt(str[0]);
			int y = Integer.parseInt(str[1]);
			String ans = dQuery(x, y, matrix);
			System.out.println(ans);
		}
	}
}