2. round, 21. november 2009.
   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 \le N \le 10\)), number of angles Mirko knows how to construct initially and \(K\) (\(1 \le K \le 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.

riseoj 작성

출처 COCI 2009/2010 Contest 2