Given an array of integers A and an integer B,
find and return the number of pairs in A whoes sum is divisible by B.
Since the answer may be large, return the answer modulo (10^9 + 7).
The first argument given is the integer array A. The second argument given is the integer B.
Return the total number of pairs for which the sum is divisible by B modulo (10^9 + 7).
1 <= length of the array <= 100000 1 <= A[i] <= 10^9 1 <= B <= 10^6
Input 1: A = [1, 2, 3, 4, 5] B = 2 Output 1: 4 Input 2: A = [5, 17, 100, 11] B = 28 Output 2: 1
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.