write a go solution for G1. Yunli's Subarray Queries (easy version)time limit per test3 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputThis is the easy version of the problem. In this version, it is guaranteed that r=l+k-1 for all queries.For an arbitrary array b, Yunli can perform the following operation any number of times:  Select an index i. Set b_i=x where x is any integer she desires (x is not limited to the interval [1,n]). Denote f(b) as the minimum number of operations she needs to perform until there exists a consecutive subarray^∗ of length at least k in b.Yunli is given an array a of size n and asks you q queries. In each query, you must output sum_j=l+k-1^rf([a_l,a_l+1,ldots,a_j]). Note that in this version, you are only required to output f([a_l,a_l+1,ldots,a_l+k-1]).^∗If there exists a consecutive subarray of length k that starts at index i (1<=i<=|b|-k+1), then b_j=b_j-1+1 for all i<j<=i+k-1.InputThe first line contains t (1<=t<=10^4) — the number of test cases.The first line of each test case contains three integers n, k, and q (1<=k<=n<=2*10^5, 1<=q<=2*10^5) — the length of the array, the length of the consecutive subarray, and the number of queries.The following line contains n integers a_1,a_2,...,a_n (1<=a_i<=n).The following q lines contain two integers l and r (1<=ql<=qr<=qn, r=l+k-1) — the bounds of the query.It is guaranteed that the sum of n over all test cases does not exceed 2*10^5 and the sum of q over all test cases does not exceed 2*10^5.OutputOutput sum_j=l+k-1^rf([a_l,a_l+1,ldots,a_j]) for each query on a new line.ExampleInput37 5 31 2 3 2 1 2 31 52 63 78 4 24 3 1 1 2 4 3 23 62 55 4 24 5 1 2 31 42 5Output2
3
2
2
2
2
1
NoteIn the first query of the first testcase, b=[1,2,3,2,1]. Yunli can make a consecutive subarray of length 5 in 2 moves:   Set b_4=4  Set b_5=5  After operations b=[1,2,3,4,5].In the second query of the first testcase, b=[2,3,2,1,2]. Yunli can make a consecutive subarray of length 5 in 3 moves:   Set b_3=0  Set b_2=-1  Set b_1=-2  After operations b=[-2,-1,0,1,2].. Output only the code with no comments, explanation, or additional text.