CF787A.The Monster

普及/提高-

通过率：0%

AC君温馨提醒

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

题目描述

A monster is chasing after Rick and Morty on another planet. They're so frightened that sometimes they scream. More accurately, Rick screams at times $b,b+a,b+2a,b+3a,...$ and Morty screams at times $d,d+c,d+2c,d+3c,...$ .

The Monster will catch them if at any point they scream at the same time, so it wants to know when it will catch them (the first time they scream at the same time) or that they will never scream at the same time.

输入格式

The first line of input contains two integers $a$ and $b$ ( $1<=a,b<=100$ ).

The second line contains two integers $c$ and $d$ ( $1<=c,d<=100$ ).

输出格式

Print the first time Rick and Morty will scream at the same time, or $-1$ if they will never scream at the same time.

输入输出样例

输入#1
```
20 2
9 19
```
输出#1
```
82
```
输入#2
```
2 1
16 12
```
输出#2
```
-1
```

说明/提示

In the first sample testcase, Rick's $5$ th scream and Morty's $8$ th time are at time $82$ .

In the second sample testcase, all Rick's screams will be at odd times and Morty's will be at even times, so they will never scream at the same time.

首页