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 <iostream>
#include <vector>
#include <algorithm>

int main() {
    size_t n;
    std::cin >> n;
    std::vector<int> a(n);
    for (size_t i = 0; i < n; ++i) std::cin >> a[i];
    size_t m;
    std::cin >> m;
    std::vector<int> b(m);
    for (size_t i = 0; i < m; ++i) std::cin >> b[i];
    std::vector<int> c;
    std::set_difference(a.begin(), a.end(), b.begin(), b.end(), back_inserter(c));
    for (int x : c) std::cout << x << std::endl;
}