CF1418F.Equal Product

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

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.

输入输出样例

  • 输入#1

    8 20
    91 100

    输出#1

    -1
    -1
    -1
    -1
    -1
    6 16 8 12
    -1
    -1
  • 输入#2

    4 5
    1 10

    输出#2

    1 2 2 1
    2 3 3 2
    -1
    -1
  • 输入#3

    5 12
    16 60

    输出#3

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