Problem: Find the difference of two sets $A = \\{a_0, a_1, ..., a_{n-1}\\}$ and $B = \\{b_0, b_1, ..., b_{m-1}\\}$, $A - B$.

Constraints

* $1 \leq n, m \leq 200,000$
* $0 \leq a_0 < a_1 < ... < a_{n-1} \leq 10^9$
* $0 \leq b_0 < b_1 < ... < b_{m-1} \leq 10^9$

Input

The input is given in the following format.


$n$
$a_0 \; a_1 \; ... \; a_{n-1}$
$m$
$b_0 \; b_1 \; ... \; b_{m-1}$


Elements in $A$ and $B$ are given in ascending order. There are no duplicate elements in each set.

Output

Print elements in the difference in ascending order. Print an element in a line.

Example

Input

5
1 2 3 5 8
2
2 5


Output

1
3
8

Solution (in JAVA):

Solution:
import java.util.Arrays;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner stdIn = new Scanner(System.in);
		int n = stdIn.nextInt();
		int a[] = new int[n];
		for(int i = 0; i < n; i++){
		    a[i] = stdIn.nextInt();
		}
		
		int m = stdIn.nextInt();
		int b[] = new int[m];
		for(int i = 0; i < m; i++){
		    b[i] = stdIn.nextInt();
		}
		
		int aindex = 0;
		int bindex = 0;
		
		while(true){
		    if(a[aindex] == b[bindex]){
		        aindex++;
		        bindex++;
		    }else if(a[aindex] > b[bindex]){
		        bindex++;
		    }else if(a[aindex] < b[bindex]){
		        System.out.println(a[aindex]);
		        aindex++;
		    }
		    
		    if(aindex == n){
		        break;
		    }
		    
		    if(bindex == m){
		        for(int i = aindex; i < n; i++){
		            System.out.println(a[i]);
		        }
		        break;
		    }
		}
        
		stdIn.close();
	}

}