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 <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=s;i<n;i++)
#define all(a) a.begin(),a.end()
typedef long long ll;
const ll inf = 1e9;
multimap<string, ll> mp;
int main(){
    int n, m;
    cin >> n;
    set<ll> a;
    rep(i,n){
        ll an; cin >> an;
        a.insert(an);
    }
    cin >> m;
    set<ll> b;
    rep(i,m){
        ll bn; cin >> bn;
        b.insert(bn);
    }

    vector<ll> c;
    set_difference(all(a), all(b), back_inserter(c));
    rep(i,c.size())cout << c[i] << endl;
    return 0;
}