Products only store A sells

Problem

Store A wants to know which products it sells that store B does not. Both lists can contain repeats.

Input: The first line has n, then a line with n products of store A. Then a line with m, then a line with m products of store B.
Output: Each product that is in A but not in B on its own line, in alphabetical order, or NONE if there is no such product.
Constraints: 1 ≤ n, m ≤ 10^5

Example

Input

4
laptop mouse cable mouse
3
cable keyboard laptop

Output

mouse

Only mouse is missing from store B.

Try the problem first. Open one hint at a time.

Hint 1

Copy store A into a TreeSet, then call removeAll with store B.

Hint 2

If the result isEmpty(), print NONE.

Write your Java code, run it on the examples and submit it to hidden tests.