Problem Statement

Good Pair Hunting Problem Description You are given two 1-indexed integer arrays A and B, each of size N, along with an integer K. An index pair (i, j) with 1 <= i < j <= N is called a good pair whenever at least one of the following holds: After temporarily adding K to A[i], compute X = A[i] - A[j] and Y = B[i] - B[j] using that adjusted value; if X <= Y, the pair qualifies. Afterward, K is subtracted back out of A[i], restoring it to its original value. After temporarily adding K to B[j], compute X = A[i] - A[j] and Y = B[i] - B[j] using that adjusted value; if X <= Y, the pair qualifies. Afterward, K is subtracted back out of B[j], restoring it to its original value. Report how many good pairs exist. Input format: The first line contains two integers N and K. The second line contains N integers A[1], A[2], ..., A[N]. The third line contains N integers B[1], B[2], ..., B[N]. Output format: Print the number of good pairs. Constraints 2 <= N <= 10^5 -10^4 <= K &