Casimir has a rectangular piece of paper with a checkered field of size n × m. Initially, all cells of the field are white.

Let us denote the cell with coordinates i vertically and j horizontally by (i, j). The upper left cell will be referred to as (1, 1) and the lower right cell as (n, m).

Casimir draws ticks of different sizes on the field. A tick of size d (d > 0) with its center in cell (i, j) is drawn as follows: 

  1. First, the center cell (i, j) is painted black. 
  2. Then exactly d cells on the top-left diagonally to the center and exactly d cells on the top-right diagonally to the center are also painted black. 
  3. That is all the cells with coordinates (i - h, j ± h) for all h between 0 and d are painted. In particular, a tick consists of 2d + 1 black cells. 



An already painted cell will remain black if painted again. Below you can find an example of the 4 × 9 box, with two ticks of sizes 2 and 3.

<image>

You are given a description of a checkered field of size n × m. Casimir claims that this field came about after he drew some (possibly 0) ticks on it. The ticks could be of different sizes, but the size of each tick is at least k (that is, d ≥ k for all the ticks).

Determine whether this field can indeed be obtained by drawing some (possibly none) ticks of sizes d ≥ k or not.

Input

The first line contains an integer t (1 ≤ t ≤ 100) — the number test cases.

The following lines contain the descriptions of the test cases. 

The first line of the test case description contains the integers n, m, and k (1 ≤ k ≤ n ≤ 10; 1 ≤ m ≤ 19) — the field size and the minimum size of the ticks that Casimir drew. The following n lines describe the field: each line consists of m characters either being '.' if the corresponding cell is not yet painted or '*' otherwise.

Output

Print t lines, each line containing the answer to the corresponding test case. The answer to a test case should be YES if the given field can be obtained by drawing ticks of at least the given size and NO otherwise.

You may print every letter in any case you want (so, for example, the strings yEs, yes, Yes, and YES will all be recognized as positive answers).

Example

Input


8
2 3 1
*.*
...
4 9 2
*.*.*...*
.*.*...*.
..*.*.*..
.....*...
4 4 1
*.*.
****
.**.
....
5 5 1
.....
*...*
.*.*.
..*.*
...*.
5 5 2
.....
*...*
.*.*.
..*.*
...*.
4 7 1
*.....*
.....*.
..*.*..
...*...
3 3 1
***
***
***
3 5 1
*...*
.***.
.**..


Output


NO
YES
YES
YES
NO
NO
NO
NO

Note

The first sample test case consists of two asterisks neither of which can be independent ticks since ticks of size 0 don't exist.

The second sample test case is already described in the statement (check the picture in the statement). This field can be obtained by drawing ticks of sizes 2 and 3, as shown in the figure.

The field in the third sample test case corresponds to three ticks of size 1. Their center cells are marked with \color{blue}{blue}, \color{red}{red} and \color{green}{green} colors: *.*.  
---  
*\color{blue}{*}**  
.\color{green}{*}\color{red}{*}.  
....  
  
The field in the fourth sample test case could have been obtained by drawing two ticks of sizes 1 and 2. Their vertices are marked below with \color{blue}{blue} and \color{red}{red} colors respectively: .....  
---  
*...*  
.*.*.  
..\color{red}{*}.*  
...\color{blue}{*}.  
  
The field in the fifth sample test case can not be obtained because k = 2, and the last asterisk in the fourth row from the top with coordinates (4, 5) can only be a part of a tick of size 1.

The field in the sixth sample test case can not be obtained because the top left asterisk (1, 1) can't be an independent tick, since the sizes of the ticks must be positive, and cannot be part of a tick with the center cell in the last row, since it is separated from it by a gap (a point, '.') in (2, 2).

In the seventh sample test case, similarly, the field can not be obtained by the described process because the asterisks with coordinates (1, 2) (second cell in the first row), (3, 1) and (3, 3) (leftmost and rightmost cells in the bottom) can not be parts of any ticks.
import java.awt.Container;
import java.awt.image.SampleModel;
import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
import java.util.concurrent.CountDownLatch;

import javax.naming.TimeLimitExceededException;

import java.io.PrintStream;


public class Solution {

	static class Pair<T,V>{
		T first;
		V second;
		public Pair(T first, V second) {
			super();
			this.first = first;
			this.second = second;
		}

	}

	// public static final boolean LOCAL = System.getProperty("ONLINE_JUDGE")==null;
	private static FastScanner fs=new FastScanner();
	private static Scanner sc=new Scanner(System.in);

	private static int uperBound(long[] arr, long val) {

		int start= 0; 
		int end=arr.length;
		while(start<end) {
			int mid=(start+end)/2;
			if( arr[mid]==val ) {
				return mid;
			}
			if( arr[mid]>val ) {
				end=mid-1;
			}else {
				start=mid+1;
			}
		}

		if( start >= arr.length || arr[start]>val) {
			return start;
		}else {
			return start+1;
		}

	}


	
	private static void solve(int TC) throws Exception{
		/*WRITE CODE HERE*/

		int r=fs.nextInt();
		int col=fs.nextInt();
		int k=fs.nextInt();
		
		char arr[][]=new char[r][col];
		
		for(int i=0;i<r;i++) {
			char  ch[]=fs.next().toCharArray();
			arr[i]=ch;
		}
		
		boolean visited[][]=new boolean[r][col];
		for(boolean b[]:visited) {
			Arrays.fill(b, false);
		}
		
		for(int i=r-1;i>=0;i--) {
			for(int j=0;j<col;j++) {
				if( arr[i][j]=='*' ) {
					int size=0;
					int d=1;
					boolean notVisited;
					if(visited[i][j]) {
						notVisited=false;
					}else {
						notVisited=true;
					}
					visited[i][j]=true;
					while( i-d>=0 && j-d>=0 ) {
						if( arr[i-d][j-d]=='*' ) {
							size++;
							visited[i-d][j-d]=true;
						}
						else {
							break;
						}
						d++;
					}
					
					if( notVisited && size<k ) {
						System.out.println("NO");
						return;
					}
					
					size=0;
					d=1;
					while( i-d>=0 && j+d<col ) {
						if( arr[i-d][j+d]=='*' ) {
							size++;
							visited[i-d][j+d]=true;
						}else {
							break;
						}
						d++;
					}
					
					if( notVisited && size<k ) {
						System.out.println("NO");
						return;
					}
					
				}
			}
			
		}
		
		for (int i = 0; i < r; i++) {
	        for (int j = 0; j < col; j++) {
	            if (arr[i][j] == '*' && !visited[i][j]) {
	                System.out.println("NO");
	                return;
	            }
	        }
	    }
		
		System.out.println("YES");
		
		
		/*int n=fs.nextInt();
		int arr[]=new int[n+1];
		for(int i=1;i<=n;i++) {
			arr[i]=fs.nextInt();
		}
		ArrayList<int[]> list=new ArrayList<int[]>();
		int smallAns[]=new int[3];
		for(int i=1;i<=n ;i++) {
			int minI=i;
			for(int j=i+1;j<=n;j++) {
				if(arr[minI]>arr[j]) {
					minI=j;
				}
			}
			
			if(minI==i) {
				continue;
			}
			//System.out.println(minI);
			int temp=arr[minI];
			for(int j=minI;j>i;j--) {
				arr[j]=arr[j-1];
			}
			arr[i]=temp;
			smallAns[0]=i;
			smallAns[1]=minI;
			smallAns[2]=minI-i;
			list.add(Arrays.copyOf(smallAns,smallAns.length));
		}
		
		System.out.println(list.size());
		for(int i=0;i<list.size();i++) {
			System.out.println(list.get(i)[0]+" "+list.get(i)[1]+" "+list.get(i)[2]);
		}
		/*System.out.println("sort");
		for(int i=1;i<=n;i++) {
			System.out.print(arr[i]+" ");
		}
		System.out.println();
		
		/*String s=fs.next();
		int a=0;
		int b=0;
		int c=0;
		for(int i=0;i<s.length();i++) {
			if(s.charAt(i)=='A') {
				a++;
			}else if( s.charAt(i)=='B' ) {
				b++;
			}else {
				c++;
			}
		}
		
		if( a+c==b ) {
			System.out.println("YES");
		}else {
			System.out.println("NO");
		}
		
		/*int w=fs.nextInt();
		int h=fs.nextInt();
		
		int x1=fs.nextInt();
		int y1=fs.nextInt();
		int x2=fs.nextInt();
		int y2=fs.nextInt();
		
		int tw=fs.nextInt();
		int th=fs.nextInt();
		
		if( !( ( w>= (Math.abs(x1-x2)+tw) || h>= (Math.abs(y1-y2)+th) ) || ( w>= ( Math.abs(x1-x2)+th ) || h>= ( Math.abs(y1-y2)+tw ) ) ) ) {
			System.out.println(-1);
			return ;
		}
		int ans=Integer.MAX_VALUE;
		if( y1>= th || h-y2>=th ) {
			ans=0;
		}else if( th+y2-y1 <= h ) {
			ans= th-y1;
			
			ans = Math.min(ans, th-( h-y2 ) );
		}
		
		if( x1>=tw || w-x2 >= tw) {
			ans=0;
		}else if( tw+ x2-x1 <= w ) {
			ans=Math.min(ans, tw-x1 );
			
			ans= Math.min(ans, tw-(w-x2) );
		}
		
		if(ans== Integer.MAX_VALUE ) {
			System.out.println(-1);
		}else if( ans<0 ) {
			System.out.println(0);
		}else
			System.out.println(ans);
		
		
		/*int col=fs.nextInt();
		
		int in[][]=new int[2][col];
		for(int i=0;i<col;i++) {
			in[0][i]=fs.nextInt();
		}
		for(int i=0;i<col;i++) {
			in[1][i]=fs.nextInt();
		}
		
		int leftSum[][]=new int[2][col];
		leftSum[0][0]=in[0][0];
		leftSum[1][0]=in[1][0];
		
		for(int i=1;i<col;i++) {
			leftSum[0][i]=in[0][i]+leftSum[0][i-1];
			leftSum[1][i]=in[1][i]+leftSum[1][i-1];
		}
		

		int rightSum[][]=new int[2][col];
		rightSum[0][col-1]=in[0][col-1];
		rightSum[1][col-1]=in[1][col-1];
		
		for(int i=col-2;i>=0;i--) {
			rightSum[0][i]=rightSum[0][i+1] + in[0][i];
			rightSum[1][i]=rightSum[1][i+1] + in[1][i];
		}
		
		
		int minScore=Integer.MAX_VALUE;
		for(int i=0;i<col;i++) {
			int score1= ( i+1<col ) ? rightSum[0][i+1] : 0;
			int score2= (i-1>=0) ? leftSum[1][i-1] : 0;
			minScore= Math.min(minScore, Math.max(score1, score2));
		}
		
		System.out.println(minScore);
		
		/*int n=fs.nextInt();
		long input[]=new long[n];
		for(int i=0;i<n;i++) {
			input[i]=fs.nextLong();
		}


		int even=0;
		for(int i=0;i<n;i++) {
			if( (input[i]&1) ==0 ) {
				even++;
			}
		}
		int odd=n-even;
		if( Math.abs(odd-even) > 1 ) {
			System.out.println(-1);
			return ;
		}
		
		for(int i=0;i<n;i++) {
			input[i]= ( (input[i]&1)==1 )?1 :0;
		}
		
		int ans=Integer.MAX_VALUE;
		if( (n&1)==0 ) {
			int output[]=new int[n];
			for(int i=0;i<n;i++) {
				output[i] = ( i&1 )==1 ? 1:0;
			}
			
			ArrayList<Integer> oddpos=new ArrayList<Integer>();
			ArrayList<Integer> evenpos=new ArrayList<Integer>();
			
			for(int i=0;i<n;i++) {
				if( input[i] != output[i] ) {
					if( (i&1)==1 ) oddpos.add(i); 
					else evenpos.add(i);
				}
			}
			int smallAns=0;
			for(int i=0;i<oddpos.size();i++) {
				smallAns+= Math.abs(oddpos.get(i)-evenpos.get(i));
			}
			
			ans=Math.min(ans, smallAns);
			
			output=new int[n];
			for(int i=0;i<n;i++) {
				output[i] = ( i&1 )==0 ? 1:0;
			}
			
			oddpos=new ArrayList<Integer>();
			evenpos=new ArrayList<Integer>();
			
			for(int i=0;i<n;i++) {
				if( input[i] != output[i] ) {
					if( (i&1)==1 ) oddpos.add(i); 
					else evenpos.add(i);
				}
			}
			smallAns=0;
			for(int i=0;i<oddpos.size();i++) {
				smallAns+= Math.abs(oddpos.get(i)-evenpos.get(i));
			}
			
			ans=Math.min(ans, smallAns);
		}else if( odd> even ) {
			int output[]=new int[n];
			for(int i=0;i<n;i++) {
				output[i] = ( i&1 )==0 ? 1:0;
			}
			
			ArrayList<Integer> oddpos=new ArrayList<Integer>();
			ArrayList<Integer> evenpos=new ArrayList<Integer>();
			
			for(int i=0;i<n;i++) {
				if( input[i] != output[i] ) {
					if( (i&1)==1 ) oddpos.add(i); 
					else evenpos.add(i);
				}
			}
			int smallAns=0;
			for(int i=0;i<oddpos.size();i++) {
				smallAns+= Math.abs(oddpos.get(i)-evenpos.get(i));
			}
			
			ans=Math.min(ans, smallAns);
		}else {
			int output[]=new int[n];
			for(int i=0;i<n;i++) {
				output[i] = ( i&1 )==1 ? 1:0;
			}
			
			ArrayList<Integer> oddpos=new ArrayList<Integer>();
			ArrayList<Integer> evenpos=new ArrayList<Integer>();
			
			for(int i=0;i<n;i++) {
				if( input[i] != output[i] ) {
					if( (i&1)==1 ) oddpos.add(i); 
					else evenpos.add(i);
				}
			}
			int smallAns=0;
			for(int i=0;i<oddpos.size();i++) {
				smallAns+= Math.abs(oddpos.get(i)-evenpos.get(i));
			}
			
			ans=Math.min(ans, smallAns);
		}
		
		
		System.out.println(ans);

		/*
		int len=fs.nextInt();
		String row1=fs.next();
		String row2=fs.next();

		int prev=-1;
		int count=0;

		for(int i=0;i<len; i++) {
			if( row1.charAt(i) != row2.charAt(i) ) {
				count+=2;
				prev=-1;
			}else if ( row1.charAt(i)=='1') {
				if(prev==0) {
					count++;
					prev=-1;
				}else {
					prev=1;
				}
			}else {
				if(prev==1) {
					count+=2;
					prev=-1;
				}else {
					count++;
					prev=0;
				}
			}
		}

		System.out.println(count);

		/*int a=fs.nextInt();
		int b=fs.nextInt();
		int c=fs.nextInt();
		int m=fs.nextInt();

		int max=a+b+c-3;

		int arr[]= {a,b,c};
		Arrays.parallelSort(arr);

		int min=arr[2]-arr[1]-arr[0]-1;
		if(m>=min && m<=max) {
			System.out.println("YES");
		}else {
			System.out.println("No");
		}
		 */
		/*
		int n=fs.nextInt();
		long hero[]=new long[n];
		long sum=0;
		for(int i=0;i<n;i++) {
			hero[i]=Long.parseLong(fs.next());
			sum+=hero[i];
		}
		//System.out.println(sum);
		Arrays.sort(hero);
		//for(long x: hero)
			//System.out.print(x+" ");
		//System.out.println();
		int m=fs.nextInt();
		while(m-->0) {

			long df=Long.parseLong(fs.next());
			long at=Long.parseLong(fs.next());



			long nextGrt=(long)Math.pow(10, 18);
			long nextSmall=-1;
			int index=uperBound(hero, df);
			//System.out.println(hero[index]);
			//System.out.println(index);
			if(index>=n) {
				nextSmall=hero[n-1];
			}else if(index<=0 ) {
				nextGrt=hero[0];
			}else {
				nextGrt=hero[index];
				nextSmall=hero[index-1];
			}

			/*for(int i=0;i<n;i++) {
				if(hero[i]>=df &&  hero[i]<nextGrt  ) {
					nextGrt=hero[i];
				}
				if(hero[i]<=df && hero[i]>nextSmall ) {
					nextSmall=hero[i];
				}
			}

			//System.out.println(nextGrt +" : "+nextSmall);

			if( nextGrt!= (long) Math.pow(10, 18) && sum-nextGrt >=at ) {
				System.out.println(0);
			}else {
				if(nextGrt==(long)Math.pow(10, 18)) {

					long ans= df- nextSmall;
					ans+= ( at<= ( sum-nextSmall ) ) ? 0 : (at- sum+nextSmall);
					System.out.println(ans);
				}
				else if(nextSmall==-1) {
					long ans= ( at <= sum- nextGrt ) ? 0 : ( at- sum+nextGrt);
					System.out.println(ans);
				}else {
					long ans1=df- nextSmall;
					ans1+= ( at<= ( sum-nextSmall ) ) ? 0 : (at- sum+nextSmall);

					long ans2= ( at <= sum- nextGrt ) ? 0 : ( at- sum+nextGrt);

					System.out.println(Math.min(ans1, ans2));
				}
			}



		}


		/*int n=fs.nextInt();

		for(int i=1;i<=n;i++) {
			String open="";
			String close="";
			for(int j=1;j<=i;j++) {
				open+="(";
				close+=")";
			}

			int j=0;
			while( j+2*i <= 2* n) {
				System.out.print(open);
				System.out.print(close);
				j=j+2*i;
			}
			//System.out.println(j);
			if(j<2*n) {
				while(j<2*n) {
					System.out.print("(");
					System.out.print(")");
					j+=2;
				}
			}
			System.out.println();
		}

		 */

	}

	public static void main(String[] args) throws Exception {

		int tcr=1; 
		//tcr = sc.nextInt();
		tcr=fs.nextInt();

		while(tcr-->0) {
			solve(tcr);

		}

		System.gc();

	}


	static int computeXOR(int n)
	{
		// If n is a multiple of 4
		if (n % 4 == 0)
			return n;

		// If n%4 gives remainder 1
		if (n % 4 == 1)
			return 1;

		// If n%4 gives remainder 2
		if (n % 4 == 2)
			return n + 1;

		// If n%4 gives remainder 3
		return 0;
	}

	static boolean isSorted (int[] nums) {

		for (int i = 0; i < nums.length - 1; i++) {

			if (nums[i] > nums[i + 1]) {

				return false;

			}

		}

		return true;

	}

	static void firstOperation (int[] nums) {

		for (int i = 1; i < nums.length; i += 2) {

			int temp = nums[i];
			nums[i] = nums[i - 1];
			nums[i - 1] = temp;

		}

	}

	static void secondOperation (int[] nums) {

		int n = nums.length / 2;

		for (int i = 0; i < n; i++) {

			int temp = nums[i];
			nums[i] = nums[i + n];
			nums[i + n] = temp;

		}

	}


	private static long numOfDigits(long a) {
		long ans=0;
		while(a!=0) {
			ans++;
			a/=10;
		}
		return ans;
	}

	private static String reverse(String s) {
		String ans="";
		for(int i=s.length()-1;i>=0;i--) {
			ans+=s.charAt(i);
		}
		return ans;
	}

	private static boolean isPalindrome(String s) {
		int i=0;
		int j=s.length()-1;

		while(i<j) {
			if(s.charAt(i)!=s.charAt(j)) {
				return false;
			}
			i++;
			j--;
		}
		return true;
	}

	static class FastScanner {

		BufferedReader br;
		StringTokenizer st ;

		FastScanner(){
			br =  new BufferedReader(new InputStreamReader(System.in));
			st = new StringTokenizer("");
		}

		FastScanner(String file) {

			try {
				br =  new BufferedReader(new InputStreamReader(new FileInputStream(file)));
				st = new StringTokenizer("");
			} catch (FileNotFoundException e) {
				// TODO Auto-generated catch block
				System.out.println("file not found");
				e.printStackTrace();
			}

		}


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

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

		long nextLong() {
			return Long.parseLong(next());
		}
		String readLine() throws IOException{
			return br.readLine();
		}
	}

	public static long[] sort(long arr[]){
		List<Long> list = new ArrayList<>();
		for(long n : arr){list.add(n);}
		Collections.sort(list);
		for(int i=0;i<arr.length;i++){
			arr[i] = list.get(i);
		}
		return arr;
	}
	public static int[] sort(int arr[]){
		List<Integer> list = new ArrayList<>();
		for(int n : arr){list.add(n);}
		Collections.sort(list);
		for(int i=0;i<arr.length;i++){
			arr[i] = list.get(i);
		}
		return arr;
	}

	// return the (index + 1)
	// where index is the pos of just smaller element
	// i.e count of elemets strictly less than num
	public static int justSmaller(long arr[],long num){
		//  System.out.println(num+"@");
		int st = 0;
		int e = arr.length - 1;

		int ans = -1;

		while(st <= e){

			int mid = (st + e)/2;

			if(arr[mid] >= num){
				e = mid - 1;
			}else{
				ans = mid;
				st = mid + 1;
			}

		}


		return ans + 1;

	}

	//return (index of just greater element)
	//count of elements smaller than or equal to num

	public static int justGreater(long arr[],long num){
		int st = 0;
		int e = arr.length - 1;

		int ans = arr.length;

		while(st <= e){

			int mid = (st + e)/2;

			if(arr[mid] <= num){
				st = mid + 1;
			}else{
				ans = mid;
				e = mid - 1;
			}
		}

		return ans;

	}


	public static boolean isPrime(int n) {

		for(int i=2;i<n;i++) {
			if(n%i==0) {
				return false;
			}
		}
		return true;
	}

	public static void println(Object obj){
		System.out.println(obj.toString());
	}

	public static void print(Object obj){
		System.out.println(obj.toString());
	}

	public static long gcd(long a,long b){
		if(b == 0l){
			return a;
		}

		return gcd(b,a%b);
	}

	public static int find(int parent[],int v){
		if(parent[v] == v){
			return v;
		}

		return parent[v] = find(parent, parent[v]);
	}



	public static List<Integer> sieve(){

		List<Integer> prime = new ArrayList<>();

		int arr[] = new int[100001];

		Arrays.fill(arr,1);

		arr[1] = 0;
		arr[2] = 1;

		for(int i=2;i<=100000;i++){

			if(arr[i] == 1){

				prime.add(i);

				for(long j = (i*1l*i);j<100001;j+=i){
					arr[(int)j] = 0;
				}
			}
		}

		return prime;
	}

	static boolean isPower(long n,long a){

		long log = (long)(Math.log(n)/Math.log(a));

		long power = (long)Math.pow(a,log);

		if(power == n){return true;}

		return false;
	}


	private static int mergeAndCount(int[] arr, int l,int m, int r)
	{

		// Left subarray
		int[] left =  Arrays.copyOfRange(arr, l, m + 1);

		// Right subarray
		int[] right = Arrays.copyOfRange(arr, m + 1, r + 1);

		int i = 0, j = 0, k = l, swaps = 0;

		while (i < left.length && j < right.length) {
			if (left[i] <= right[j])
				arr[k++] = left[i++];
			else {
				arr[k++] = right[j++];
				swaps += (m + 1) - (l + i);
			}
		}
		while (i < left.length)
			arr[k++] = left[i++];
		while (j < right.length)
			arr[k++] = right[j++];
		return swaps;
	}

	// Merge sort function
	private static int mergeSortAndCount(int[] arr, int l,int r)
	{

		// Keeps track of the inversion count at a
		// particular node of the recursion tree
		int count = 0;

		if (l < r) {
			int m = (l + r) / 2;

			// Total inversion count = left subarray count
			// + right subarray count + merge count

			// Left subarray count
			count += mergeSortAndCount(arr, l, m);

			// Right subarray count
			count += mergeSortAndCount(arr, m + 1, r);

			// Merge count
			count += mergeAndCount(arr, l, m, r);
		}

		return count;
	}

	static class Debug {
		//change to System.getProperty("ONLINE_JUDGE")==null; for CodeForces
		public static final boolean LOCAL = System.getProperty("ONLINE_JUDGE")==null;
		private static <T> String ts(T t) {
			if(t==null) {
				return "null";
			}
			try {
				return ts((Iterable) t);
			}catch(ClassCastException e) {
				if(t instanceof int[]) {
					String s = Arrays.toString((int[]) t);
					return "{"+s.substring(1, s.length()-1)+"}\n";
				}else if(t instanceof long[]) {
					String s = Arrays.toString((long[]) t);
					return "{"+s.substring(1, s.length()-1)+"}\n";
				}else if(t instanceof char[]) {
					String s = Arrays.toString((char[]) t);
					return "{"+s.substring(1, s.length()-1)+"}\n";
				}else if(t instanceof double[]) {
					String s = Arrays.toString((double[]) t);
					return "{"+s.substring(1, s.length()-1)+"}\n";
				}else if(t instanceof boolean[]) {
					String s = Arrays.toString((boolean[]) t);
					return "{"+s.substring(1, s.length()-1)+"}\n";
				}
				try {
					return ts((Object[]) t);
				}catch(ClassCastException e1) {
					return t.toString();
				}
			}
		}
		private static <T> String ts(T[] arr) {
			StringBuilder ret = new StringBuilder();
			ret.append("{");
			boolean first = true;
			for(T t: arr) {
				if(!first) {
					ret.append(", ");
				}
				first = false;
				ret.append(ts(t));
			}
			ret.append("}");
			return ret.toString();
		}
		private static <T> String ts(Iterable<T> iter) {
			StringBuilder ret = new StringBuilder();
			ret.append("{");
			boolean first = true;
			for(T t: iter) {
				if(!first) {
					ret.append(", ");
				}
				first = false;
				ret.append(ts(t));
			}
			ret.append("}");
			return ret.toString();
		}
		public static void dbg(Object... o) throws Exception {
			if(LOCAL) {
				PrintStream ps = new PrintStream("src/Debug.txt");
				System.setErr(ps);
				System.err.print("Line #"+Thread.currentThread().getStackTrace()[2].getLineNumber()+": [");
				for(int i = 0; i<o.length; i++) {
					if(i!=0) {
						System.err.print(", ");
					}
					System.err.print(ts(o[i]));
				}
				System.err.println("]");
			}
		}
	}

}