eolymp
Competitions

Виток 1, Шаг 7 - Линейный массив

Keyboard

Everybody knows that eventually wear out the keyboard and the keys start sticking to it. Of course, while such a keyboard can still be used, but for the keystrokes have to use greater force.

When manufacturing the keyboard initially for each key sets the number of clicks, which it must withstand. If you know these values for your keyboard, then the sequence keystrokes, you can determine which keys to use during their break, but what - no.

Determine which keys will break during the given keyboard usage scenario.

Input

The first line contains an integer n (1n100) – the number keys on the keyboard. The second line contains n integers – c1, c2, ... , cn, where ci (1ci100000) – the number of clicks, resistant to the i-th key. The third line contains an integer k (1k100000) – The total number of keystrokes, and the last line contains k integers pj (1pjn) – a sequence of keystrokes.

Output

Print n lines containing information about the serviceability of the keys. If the i-th key is broken, the i-th row must contain the word "yes" (without the quotes), if the key is buildable - the word "no".

Time limit 1 second
Memory limit 128 MiB
Input example #1
5
1 50 3 4 3
16
1 2 3 4 5 1 3 3 4 5 5 5 5 5 4 5
Output example #1
yes
no
no
no
yes