Given an array of N integers, using ‘+’ and ‘-‘ between the elements check if there is a way to form a sequence of numbers which evaluate to a number divisible by M.

**Input:**

The first line contains **T,** the number of test cases.For each test case, the first line contains an integer **n **denoting the size of the array **A**. Next line contains n-space separated integers and next line contains an integer **m** denoting the number from which divisibility needs to be checked.

**Output:**

For each test case, the output is 1 if divisible else 0.

**Constraints:**

1<=T<=100

1<=n<=50

1<=m<=10

**Note: **Sum of elements should be less than 1000.

**Example:
Input**

2

5

1 2 3 4 6

4

3

1 3 9

2

1

0

**Explanation:
1.**There is a valid sequence i. e., (1 - 2 + 3 + 4 + 6), which evaluates to 12 that is divisible by 4.

Author: Vanshika_pec

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.