// Arup Guha
// 2/25/2020
// Solution to 2020 UCF HS Contest Problem: Ahmad's Mod

import java.util.*;

public class mod {

	public static void main(String[] args) {
	
		Scanner stdin = new Scanner(System.in);
		int nC = stdin.nextInt();
		
		// Process all cases.
		for (int loop=0; loop<nC; loop++) {
		
			// I just care about distinct values, in order.
			int n = stdin.nextInt();
			TreeSet<Integer> ts = new TreeSet<Integer>();
			for (int i=0; i<n; i++)
				ts.add(stdin.nextInt());
				
			int res = -1;
			int prev = ts.pollFirst();
			
			// Just look for differences between consecutive sorted values.
			while (ts.size() > 0) {
				
				// Get next and calculate difference with previous value.
				int cur = ts.pollFirst();
				int diff = cur-prev;
				
				// For the first go around, my best answer is the difference.
				if (res == -1) res = diff;
				
				// Otherwise, just take the running gcd.
				else res = gcd(res, diff);
			}
		
			// Ta da!
			if (res == -1)
				System.out.println("Thank you, Maude!");
			else
				System.out.println(res);
		}
	}
	
	// Returns the gcd of a and b.
	public static int gcd(int a, int b) {
		return b == 0 ? a : gcd(b, a%b);
	}
}