Longest Subarray Divisble By K :
Difficulty Level : Medium
Submissions : 1051
Asked In :
Marks :100
: 19 | : 2
Given an array of N, integers Find the longest subarray which is divisible by K.
Input
The first line of the integer contains two integers N, K the number of elements in the array and K ($$$1 \le N, K \le 10^5$$$)
Next line contains N spaces integers the value of the array integers value may include negative value too.
Output
For each test case print the length of the longest subarray.
Example
Input
6 3 7 8 3 -3 4 2
Output
6
