DCEPC504 - The Indian Connection

Rajesh Kuthrapali has a weird family structure. Every male member gives birth to a male child first and then a female child whereas every female member gives birth to a female child first and then to a male child. Rajesh analyses this pattern and wants to know what will be the Kth child in his Nth generation. Help him.

Note:

  1. Every member has exactly 2 children.
  2. The generation starts with a male member (Rajesh).
  3. In the figure given below:
                               M ------------ 1st generation
                             /   \
                            /     \
                           /       \
                          M         F ------- 2nd generation
                        /   \     /   \
                       M     F   F     M
                                 |
                                3rd child of 3rd generation

Input

First line specifies T, the number of test cases.

Next T lines each gives 2 numbers, N and K.

Output

Output 1 line for each test case giving the gender of the Kth child in in Nth generation.

Print “Male” for male “Female” for female (quotes only for clarification).

Constraints

1 <= T <=100
1 <= N <=10000
1 <= K <= min(10^15, 2^(n-1))

Example

Input:
4
1 1
2 1
2 2
4 5

Output:
Male
Male
Female
Female

Added by:dce coders
Date:2012-04-18
Time limit:1.726s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:ASM32-GCC MAWK BC C-CLANG C NCSHARP C++ 4.3.2 CPP CPP14 CPP14-CLANG COBOL COFFEE D-CLANG D-DMD DART ELIXIR FANTOM FORTH GOSU GRV JAVA JS-MONKEY JULIA KTLN NIM NODEJS OBJC OBJC-CLANG OCT PICO PROLOG PYPY PYPY3 PY_NBC R RACKET RUST CHICKEN SQLITE SWIFT UNLAMBDA VB.NET
Resource:Own Problem

hide comments
2012-12-29 09:27:25 Aniket Kumar
No need to generate array as well... :P

Last edit: 2012-12-29 09:29:43
2012-12-20 19:42:19 shiva_hellgeek
Very nice problem no need of n, no need of tree it only requires a bit of logic...
:)
2012-10-22 10:34:46 ɥsǝןǝǝu
is the following is possible...
1
2 3
EDIT:i was wrong

Last edit: 2012-10-22 11:12:31
2012-10-15 04:41:35 shreyas
Please check my submission. I am unable to find the bug.
Id -7856445.

Last edit: 2012-10-15 04:41:59
2012-08-22 09:40:51 VV
@AC srinivas : Please! That itself spoils half the problem.
2012-08-01 12:49:53 Naman
I implemented the whole path of the tree, from root to the required child. It surely requires n. Is there a formula as well?
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.