SMPSEQ3 - Fun with Sequences

You are given a sorted sequence of n integers S = s1, s2 ... sn and a sorted sequence of m integers Q = q1, q2 ... qm.

Please print in ascending order all such si that does not belong to Q.

Input data specification

In the first line you are given one integer 2 <= n <= 100, and in the following line n integers:
-100 <= si <= 100, si <= si+1.

In the third line you are given one integer 2 <= m <= 100, and in the following line m integers:
-100 <= qi <= 100, qi <= qi+1.

Output data specification

The sequence of requested integers separated by spaces.

Example

Input:
5
-2 -1 0 1 4
6
-3 -2 -1 1 2 3

Output:
0 4

Added by:kuszi
Date:2013-11-14
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64

hide comments
2016-12-06 15:36:07
guess what my code gives the same output but is not accepted by SPOJ.
2016-11-04 06:02:47
what an easy one!!!
2016-08-27 11:42:28
Do i need to assume the array is sorted or do i need to sort the array myself???
2016-08-07 17:55:05
My code compiled correctly in ideone but here it's showing wrong answer...please help.
2016-06-08 15:12:44
BINARY SERACH ROCKS!!!!!!!!!!!!
YEPPPPEEEEEEEEEEEEEE
2015-12-04 17:29:18
easy stuff.
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.