시간 제한메모리 제한제출정답맞힌 사람정답 비율
3 초 1024 MB437625.000%

문제

You have given integers $a$, $b$, $p$, and $q$. Let $f(x) = \text{abs}(\text{sin}(\frac{p}{q} \pi x))$.

Find minimum possible integer $x$ that maximizes $f(x)$ where $a \le x \le b$.

입력

Each test contains multiple test cases.

The first line contains the number of test cases $t$ ($1 \le t \le 100$) --- the number of test cases.

The first line of each test case contains four integers $a$, $b$, $p$, and $q$ ($0 \le a \le b \le 10^{9}$, $1 \le p$, $q \le 10^{9}$).

출력

Print the minimum possible integer $x$ for each test cases, separated by newline.

예제 입력 1

2
0 3 1 3
17 86 389 995

예제 출력 1

1
55

노트

In the first test case, $f(0) = 0$, $f(1) = f(2) \approx 0.866$, $f(3) = 0$.

In the second test case, $f(55) \approx 0.999969$, which is the largest among all possible values.

출처

Contest > Codeforces > Codeforces Round 566 (Div. 2) F번