B"We'll call a sequence of integers a good k-d sequence if we can add to it at most k numbers in such a way that after the sorting the sequence will be an arithmetic progression with difference d. You got hold of some sequence a, consisting of n integers. Your task is to find its longest contiguous subsegment, such that it is a good k-d sequence. The first line contains three space-separated integers n, xe2 x80 x89k, xe2 x80 x89d (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x892 xc2 xb7105; 0 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89k xe2 x80 x89 xe2 x89 xa4 xe2 x80 x892 xc2 xb7105; 0 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89d xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89109). The second line contains n space-separated integers: a1, xe2 x80 x89a2, xe2 x80 x89..., xe2 x80 x89an ( xe2 x80 x89- xe2 x80 x89109 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89ai xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89109) -- the actual sequence. Print two space-separated integers l, xe2 x80 x89r (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89l xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89r xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n) show that sequence al, xe2 x80 x89al xe2 x80 x89+ xe2 x80 x891, xe2 x80 x89..., xe2 x80 x89ar is the longest subsegment that is a good k-d sequence. If there are multiple optimal answers, print the one with the minimum value of l. In the first test sample the answer is the subsegment consisting of numbers 2, 8, 6 -- after adding number 4 and sorting it becomes sequence 2, 4, 6, 8 -- the arithmetic progression with difference 2."...