
ZOJ Problem Set  1373
Let's consider so called "sly number" which is given as an array A of N integers from set {0,1,2}. For example A[0]=1, A[1]=1, A[2]=0 and A[3]=2. A sly number is called ONE, if A[0]=1 and A[I]=0 for I=1,2,��,N1. Consider following operation with two sly numbers A and B called 'Star Multiplication': C[k] = sum 0 to k ( A[i] * B[ki] ) + sum k+1 to N1 ( A[i] * B[N+ki] ). here C  the result of the operation, even also presented in an array  not
necessarily sly number. This operation we will denote by <*> symbol. Moreover, there is also module operation over the results of 'Star Multiplication': (C mod Q) [i] = C[i] mod Q, where Q is a positive integer. (A * B) mod Q = ONE. The input file contains K data sets in text format. The first line of this file contains the number K of test cases. Each test consists of two lines. First line contains two integers separated by spaces: Q (2 <= Q <= 100) and N (5 <= N <= 50). Second line contains N integers from set {0,1,2} separated by spaces, which present sly number A. The output should be printed on the standard output. It should contain K lines  one line for each test case. If a solution exists, the line should contain the string "A solution can be found". In case there is no solution, the line should consist of string 'No solution'.
2
A solution can be found
Source: Southeast Europe 2002 