#include <bits/stdc++.h>
#define r(i,n) for(int i = 0; i<n; i++)
typedef long long ll;
using namespace std;

int main(){
  int n,m,a;
  set<int> s,t;
  cin >> n;
  while(n--){
    cin >> a;
    s.insert(a);
  }
  cin >> m;
  while(m--){
    cin >> a;
    t.insert(a);
  }
  vector<int> v;
  set_difference(s.begin(),s.end(),t.begin(),t.end(),back_inserter(v));
  r(i,v.size()){
    cout << v.at(i)<<endl;
  }
}

### Prompt

Please provide a Cpp coded solution to the problem described below:

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

### Response

```cpp
#include <bits/stdc++.h>
#define r(i,n) for(int i = 0; i<n; i++)
typedef long long ll;
using namespace std;

int main(){
  int n,m,a;
  set<int> s,t;
  cin >> n;
  while(n--){
    cin >> a;
    s.insert(a);
  }
  cin >> m;
  while(m--){
    cin >> a;
    t.insert(a);
  }
  vector<int> v;
  set_difference(s.begin(),s.end(),t.begin(),t.end(),back_inserter(v));
  r(i,v.size()){
    cout << v.at(i)<<endl;
  }
}

```