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 CPP):

Solution:
#include <algorithm>
#include<iostream>
#include<vector>
#include<deque>
#include<queue>
#include<list>
#include<stack>
#include<map>
#include<set>
#include<string>
#include <sstream>

#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<limits.h>

using namespace std;


int main(){
  long ii,jj,kk;

  int n,m,v;
  set<int> a,b;
  cin >> n;

  for(ii=0;ii<n;ii++){
    cin >> v;
    a.insert(v);
  }

  cin >> m;

  for(ii=0;ii<m;ii++){
    cin >> v;
    b.insert(v);
  }

  set<int>::iterator it;
  set<int> c;
  it = a.begin();

  while(it != a.end()){
    if(b.find(*it) == b.end()){
      c.insert(*it);
    }
    it++;
  }

  it = c.begin();
  
  while(it != c.end()){
    cout << *it << endl;
    it++;
  }
  
  return 0;
  
}