## Problem

CodeChef offers a feature called streak count. A streak is maintained if you solve at least one problem daily.

Om and Addy actively maintain their streaks on CodeChef. Over a span of  consecutive days, you have observed the count of problems solved by each of them.

### Input Format

• The first line of input will contain a single integer , denoting the number of test cases.
• Each test case consists of multiple lines of input.
• The first line of each test case contains an integer  — the number of days.
• The second line of each test case contains  space-separated integers, the ��ℎ of which is ��, representing the problems solved by Om on the ��ℎ day.
• The third line of each test case contains  space-separated integers, the ��ℎ of which is ��, representing the problems solved by Addy on the ��ℎ day.

### Output Format

For each test case, output:

• OM, if Om has longer maximum streak than Addy;
• ADDY, if Addy has longer maximum streak than Om;
• DRAW, if both have equal maximum streak.

You may print each character in uppercase or lowercase. For example, OMomOm, and oM, are all considered the same.

### Constraints

• 1≤�≤105
• 1≤�≤105
• 0≤��,��≤109
• The sum of  over all test cases won't exceed 6⋅105.

### Sample 1:

Input

Output

3
6
1 7 3 0 2 13
0 2 3 4 5 0
3
1 3 4
3 1 2
5
1 2 3 0 1
1 2 0 2 3
Addy
Draw
Om

### Explanation:

Test case 1: Om has a maximum streak of 3 days, while Addy has a maximum streak of 4 days.

Test case 2: Both have the same maximum streak of 3 days.

Test case 3: Addy has a maximum streak of 2 days and Om has a maximum streak of 3 days.