The registry keeper Hema has been asked to decode the foreman's shorthand notes. On the desk lies a long table of panels readings. Task: Print the number of index pairs (i,j), i<j, with a[i]+a[j] <= k. Input format: First line: n and k. Second line: n integers. Output format: Print the pair count (fits 64-bit). Constraints: 2 <= n <= 2395; 0 <= a[i],k <= 1000000000.
Example 1:
Example 2:
Example 3:
Constraints:
2 <= n <= 2395; 0 <= a[i],k <= 1000000000.
