Christmas Game

Time Limit: 1000MS

Memory Limit: 65536K

Description

Harry and Sally were playing games at Christmas Eve. They drew some Christmas trees on a paper:

Input

The input file contains multiply test cases. The first line of each test case is an integer N (N<100), which represents the number of sub-trees. The following lines show the structure of the trees. The first line of the description of a tree is the number of the nodes m (m<100) and the number of the edges k (k<500). The nodes of a tree are numbered from 1 to m. Each of following lines contains 2 integers a and b representing an edge <a, b>. Node 1 is always the root.

Output

For each test case, output the name of the winner.

Sample Input

2
2 1
1 2
4 4
1 2
2 3
2 4
3 4

Sample Output

Sally

Hint

The sample graph is

Source

POJ Founder Monthly Contest – 2008.12.28, Yao

提交代码