문제

Author: Bruno Rahle One day Mirko was cleaning up his room and found a straightedge and a compass. He went to the school the next day and challenged his friend Slavko to a geometric construction battle. Mirko knows how to construct some angles using the straightedge and compass and knows how to subtract and add any two angels he constructs. Slavko now shouts random angles and Mirko must draw them as fast as possible. You are observing this battle and would like to know if Mirko can construct the angles Slavko shouts at all.

입력

The first line of input contains two integers, N (1 ≤ N ≤ 10), number of angles Mirko knows how to construct initially and K (1 ≤ K ≤ 10), number of angles Slavko selected. The second line of input contains N integers, all smaller than 360, the angles Mirko knows how to construct initially. The third line contains K integers, all smaller than 360, the angles Slavko selected.

출력

Output consist of K lines, one for each angle Slavko selected. The i-th line should contain "YES" if Mirko can construct the i-th angle, and "NO" otherwise.

예제 입력 1

2 1
30 70
40

예제 출력 1

YES

예제 입력 2

1 1
100
60

예제 출력 2

YES

예제 입력 3

3 2
10 20 30
5 70

예제 출력 3

NO
YES