Hello, codeforces!

All signs in the sky and on the ground indicate that you've enjoyed my first blog, so here is the second one. I've decided to choose a Polish task again, as there are plenty of interesting ones. This time we'll take a look at the "plot purchase" (you can submit here), which is a bit easier, but a few years ago I was very proud of myself when I solved it. The statement goes as follows:

You are given a square *n* × *n* grid (1 ≤ *n* ≤ 2000). In every cell, there is a number from the range [1, 2·10^{9}]. You are also given an integer *k* (1 ≤ *k* ≤ 10^{9}). A task is to find a subrectangle of this grid such that the sum of values in this subrectangle lies in the range [*k*, 2·*k*] (or report that there is no such subrectangle). Just print coordinates of its opposite corners.