One day Jim came across array of N numbers(a[N]).He decided to divide these N numbers into different groups.Each group contains numbers in which sum of any two numbers should not be divisible by an integer K.Print the size of the group containing maximum numbers.

**Input:**

First line of the input contains an integer **T**, denoting the number of test cases. Then T test cases follows.The first line of each test case contains 2 space-separated integers N and K respectively.

The second line contains N space-separated integers denoting the N numbers which Jim came across.

**Output:**

Print the size of the group containing maximum numbers in a new line.

**Constraints:**

1<=T<=100

1<=N<=100000

1<=K<=100000

1<=a[i]<=100000;1<=i<=N

**Example:**

**Input:**

1

4 8

1 7 2 6

**Output:**

2

**Explanation:**

K=8

The group of numbers which can be formed are: (1),(2),(7),(6),(1,2),(1,6),(7,2),(7,6),So,the maximum possible size if the group is 2.

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.

VivSisMMM | 164 |

d_Coder00 | 163 |

ajayjadhav35 | 153 |

Astikeysingh | 148 |

Sathvik Avasarala | 143 |

Pulkit__Sharma__ | 658 |

Anirban166 | 565 |

abducodes | 542 |

Sathvik Avasarala | 506 |

Found_me | 494 |

blackshadows | 5331 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4929 |

Quandray | 4559 |

Login to report an issue on this page.