cf 教育场 45Commentary Boxes

A. Commentary Boxes

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Berland Football Cup starts really soon! Commentators from all over the world come to the event.

Organizers have already built $n$ commentary boxes. $m$ regional delegations will come to the Cup. Every delegation should get the same number of the commentary boxes. If any box is left unoccupied then the delegations will be upset. So each box should be occupied by exactly one delegation.

If $n$ is not divisible by $m$, it is impossible to distribute the boxes to the delegations at the moment.

Organizers can build a new commentary box paying $a$ burles and demolish a commentary box paying $b$ burles. They can both build and demolish boxes arbitrary number of times (each time paying a corresponding fee). It is allowed to demolish all the existing boxes.

What is the minimal amount of burles organizers should pay to satisfy all the delegations (i.e. to make the number of the boxes be divisible by $m$)?

Input

The only line contains four integer numbers $n$, $m$, $a$ and $b$ ($1\le n,m\le {10}^{12}$, $1\le a,b\le 100$), where $n$ is the initial number of the commentary boxes, $m$ is the number of delegations to come, $a$ is the fee to build a box and $b$ is the fee to demolish a box.

Output

Output the minimal amount of burles organizers should pay to satisfy all the delegations (i.e. to make the number of the boxes be divisible by $m$). It is allowed that the final number of the boxes is equal to $0$.

Examples

input

Copy

9 7 3 8

output

Copy

15

input

Copy

2 7 3 7

output

Copy

14

input

Copy

30 6 17 19

output

Copy

0

Note

In the first example organizers can build $5$ boxes to make the total of $14$ paying $3$ burles for the each of them.

In the second example organizers can demolish $2$ boxes to make the total of $0$ paying $7$ burles for the each of them.

In the third example organizers are already able to distribute all the boxes equally among the delegations, each one get $5$ boxes.

题意： 有 n 个箱子，m 只队，增加箱子每个花费为 a ，销毁箱子每个花费为b。求使 m 只队得到的箱子数相等的最少花费。

思路： 简单贪心，分别找第一个比 n 大的 m 的倍数和第一个比 n 小的 m 的倍数，求一下花费。 

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
    ll n,m,a,b;
    cin>>n>>m>>a>>b;
    ll ans=n%m*b;
    if(ans) ans=min(ans,(m-n%m)*a);
    else ans=0;
    cout<<ans<<endl;
    return 0;
}