Given an array of integers and a positive integer k$,$ determine the number of $($i$,$ j$)$ pairs where i $$ j and ar$[$i$]+$ ar$[$j$]$ is divisible by k$.$ Example ar $[1,2,3,4,5,6]$ k$=5$ Three pairs meet the criteria: $[1,4],[2,3],$ and $[4,6].$ Function Description Complete the divisibleSumPairs function in the editor below. divisibleSumPairs has the following parameter$($s$)$: $$ int n: the length of array ar $$int ar$[$n$]$: an array of integers $.$ int k: the integer divisor Returns $-$int: the number of pairs Input Format The first line contains $2$ space$-$separated integers, $11$ and k$.$ The second line contains space$-$separated integers, each a value of arr$[$i$].$ Constraints n ar$[4]+$ ar$[5]=1+2=3$Function Description

More

Complete the divisibleSumPairs function in the editor below.

divisible$5$umPairs has the following parameter$($s$)$:

int n: the length of array $ar$

int ar$[$n$]$: an array of integers

int $k$ : the integer divisor

Returns

int: the number of pairs

Input Format

The first line contains $2$ space$-$separated integers, $n$ and $k.$

The second line contains $n$ space$-$separated integers, each a value of arr$[i].$

Constraints

$2n100$

$1k100$

$1ar[i]100$

Sample Input

STDIN

Function

$63$

$-6,k-3$

ar $-[1,3,2,6,1,2]$

Sample Output

$5$

Explanation

Here are the $5$ valid pairs when $k=3$ :

$(0,2)ar[0]+ar[2]=1+2=3$

$(0,5)ar[0]+ar[5]=1+2=3$

$(1,3)ar[1]+ar[3]=3+6=9$

$(2,4)ar[2]+ar[4]=2+1=3$

$(4,5)ar[4]+ar[5]=1+2=3$

with Ada.Text$\_$IO$,$ Ada.Integer$\_$Text$\_$IO;

use Ada;

procedure Solution is

$--$ Enter your code here. Read input from STDIN. Print output to STDOUT

end Solution