StablePairsDiv1

Consider the set of integers between 1 and n, inclusive, and two positive integers c and k. You want to build an ordered list of k pairs (x₁, y₁), (x₂, y₂), ... (x_k, y_k) such that the following conditions are met.

1. 1 ≤ x_i < y_i ≤ n for all i between 1 and k, inclusive.
2. y_i < x_i+1 for all i between 1 and k-1, inclusive.
3. (x_i+1 + y_i+1) - (x_i + y_i) = c for all i between 1 and k-1, inclusive.

If a list of pairs satisfies all of the above conditions, the list is said to be stable. For any fixed n, c, and k, a stable list of k pairs is said to be maximal if its sum of elements (the sum of all 2k integers it contains) is the largest among all stable lists of k pairs.

For instance, consider n=5, c=4, and k=2. There are two stable lists of pairs: one is [(1, 2), (3, 4)] and the other is [(2, 3), (4, 5)]. The latter is the only maximal stable list of pairs in this example as its sum is (2+3+4+5) = 14.

Given n, c, and k, find one maximal stable list of pairs, and return a int[] that describes the list. Specifically, if (x₁, y₁), (x₂, y₂), ..., (x_k, y_k) is your maximal stable list of pairs, you must return { x₁, y₁, x₂, y₂, ..., x_k, y_k }.

If there are many maximal stable lists of pairs, you may return any one of them. If no stable list of pairs with the desired properties exists, you must return an empty int[].