BETA

#### Submissions: 827 Accuracy: 17.41%

Subset with sum divisible by m

Given a set of non-negative distinct integers, and a value m, determine if there is a subset of the given set with sum divisible by m.

Input:

The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains an integer N and M where N denotes the size of the array and M is the number for which we have to check the divisibility.

The second line of each test case contains N space separated integers denoting elements of the array A[ ].

Output:

If there is a subset which is divisible by M print '1' else print '0'.

Constraints:

1<= T <=100

1<= N,M <=1000

1<= A[ ] <=1000

Example:

Input:

1

4 6

3 1 7 5

Output:

1

#### ** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Sujnesh Mishra

##### It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result: