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[i] <=1000

**Example:**

**Input:**

1

4 6

3 1 7 5

**Output:**

1

Author: sujnesh

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

ShubhamJain18 | 205 |

makeitdonesolo | 140 |

lost_found | 124 |

maggiiiii | 118 |

SahatPrasad1 | 108 |

Bishnu Dev Panda | 777 |

okayboss | 551 |

ShubhamJain18 | 516 |

yk12 | 514 |

makeitdonesolo | 480 |

blackshadows | 5331 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4925 |

Quandray | 4547 |

Login to report an issue on this page.