Level up game: 'a' and his friend 'B' are addicted to the game called "level up game", which consists of n levels. Both want to clear the entire game.

'A' and his friend 'B' are addicted to the game called "Level Up Game", which consists of n levels. Both want to clear the entire game.

'A' can clear only x number of levels of the game. And 'B' can clear only y number of levels of the game. Given the levels 'A' can clear and the levels 'B' can clear, can 'A' and 'B' clear the entire game if they work together?

Input Format

Starting line consists of single integer n. The following line contains an integer x as the first integer, then follows x distinct integers m1, m2, ..., mx. These integers denote the levels 'A' can clear. The third line consists the levels 'B' can clear in the same format as the second line, assuming that the levels are numbered 1 to n.

Constraints

n (1 ≤  n ≤ 100)

x (0 ≤ x ≤ n)

(1 ≤ mi ≤ n)

Output Format

If they can clear all the levels, print "GAME CLEARED". If it's impossible, print "GAME NOT CLEARED" (without the quotes).

Sample Input 0

4
3 1 2 3
2 2 4
Sample Output 0

GAME CLEARED

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {
    
    public static void main(String args[] ) throws Exception {
        /* Enter your code here. Read input from STDIN. Print output to STDOUT */
   Scanner s=new Scanner(System.in);
        int n=s.nextInt();
        int x=s.nextInt();
        int y=s.nextInt();
        int[] arr1 = new int[x]; 
        int[] arr2 = new int[y];
        
        
    
    }
}