For this Question: There are n boys and m toys. Your task is to distribute the toys so that as many boys as possible will get a toy.
Each boy has a desired toy size, and they will accept any toy whose size is close enough to the desired size.
So if the desired toy size of a particular boy is 'a' and a particular toy has size 'b', then boy will only accept the toy if |b-a| <= k.The first input line has three integers n, m, and k: the number of boys, the number of toys, and the maximum allowed difference.

The next line contains n integers a[1], a[2],…, a[n]: the desired toy size of each boy. If the desired toy size of a boy is x, he will accept any toy whose size is between x−k and x+k.

The last line contains m integers b[1], b[2],…, b[m]: the size of each toy.

<b>Constraints</b>
1 ≤ n,m ≤ 200000
0 ≤ k ≤ 10<sup>9</sup>
1 ≤ a[i],b[i] ≤ 10<sup>9</sup>Print one integer: the number of boys who will get a toy.Sample Input
4 3 5
60 45 80 60
30 60 75

Sample Output
2

Explanation: One possible way can give second toy to first boy and third toy to third boy.

Sample Input:
10 10 0
37 62 56 69 34 46 10 86 16 49
50 95 47 43 9 62 83 71 71 7

Sample Output:
1, I have written this Solution Code: n,m,k=[int(x) for x in input().split()[:3]]
a=[int(x) for x in input().split()[:n]]
b=[int(x) for x in input().split()[:m]]
a.sort()
b.sort()
j = 0
sum1 = 0
for i in a:
    while(j<len(b)):
        if(i-k<=b[j] and b[j]<=i+k):
            j = j+1
            sum1 +=1
            break
        elif i+k<b[j]:
            break
        else:
            j +=1
    if(j>=len(b)):
        break
print(sum1), In this Programming Language: Python, Now tell me if this Code is compilable or not?