#P1418F. Equal Product

    ID: 1208 Type: RemoteJudge 2000ms 256MiB Tried: 0 Accepted: 0 Difficulty: (None) Uploaded By: Tags>data structuresmathnumber theorytwo pointers*3000

Equal Product

No submission language available for this problem.

Description

You are given four integers nn, mm, ll and rr.

Let's name a tuple (x1,y1,x2,y2)(x_1, y_1, x_2, y_2) as good if:

  1. 1x1<x2n1 \le x_1 < x_2 \le n;
  2. 1y2<y1m1 \le y_2 < y_1 \le m;
  3. x1y1=x2y2x_1 \cdot y_1 = x_2 \cdot y_2;
  4. lx1y1rl \le x_1 \cdot y_1 \le r.

Find any good tuple for each x1x_1 from 11 to nn inclusive.

The first line contains two integers nn and mm (1n,m21051 \le n, m \le 2 \cdot 10^5).

The second line contains two integers ll and rr (1lrnm1 \le l \le r \le nm).

For each x1x_1 from 11 to nn inclusive:

  • if there are no such four integers, print 1-1;
  • otherwise, print four integers x1x_1, y1y_1, x2x_2 and y2y_2. If there are multiple answers, print any of them.

Input

The first line contains two integers nn and mm (1n,m21051 \le n, m \le 2 \cdot 10^5).

The second line contains two integers ll and rr (1lrnm1 \le l \le r \le nm).

Output

For each x1x_1 from 11 to nn inclusive:

  • if there are no such four integers, print 1-1;
  • otherwise, print four integers x1x_1, y1y_1, x2x_2 and y2y_2. If there are multiple answers, print any of them.

Samples

Sample Input 1

8 20
91 100

Sample Output 1

-1
-1
-1
-1
-1
6 16 8 12
-1
-1

Sample Input 2

4 5
1 10

Sample Output 2

1 2 2 1
2 3 3 2
-1
-1

Sample Input 3

5 12
16 60

Sample Output 3

-1
2 9 3 6
3 8 4 6
4 5 5 4
-1