|All-time Popular Problems|
|Construct Tree from Inorder & Preorder|
|Sum of two large numbers|
|Level order traversal in spiral form|
|Spirally traversing a matrix|
|Angle between hour and minute hand|
|Binary Tree to DLL|
|Smallest Positive missing number|
|Height of Binary Tree|
|Largest Number formed from an Array|
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.
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[ ].
If there is a subset which is divisible by M print '1' else print '0'.
1<= T <=100
1<= N,M <=1000
1<= A[ ] <=1000
3 1 7 5