C. Minimum Modulartime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have been given n distinct integers a1, a2, ..., an. You can remove at most k of them. Find the minimum modular m (m > 0), so that for every pair of the remaining integers (ai, aj), the following unequality holds: .InputThe first line contains two integers n and k (1  ≤ n  ≤ 5000, 0 ≤ k ≤ 4), which we have mentioned above. The second line contains n distinct integers a1, a2, ..., an (0 ≤ ai ≤ 106).OutputPrint a single positive integer — the minimum m.ExamplesInput7 00 2 3 6 7 12 18Output13Input7 10 2 3 6 7 12 18Output7
Input7 00 2 3 6 7 12 18
Output13
['brute force', 'graphs', 'math', 'number theory', '*2400']