Codeforces Round #451 (Div. 2) - （A，B）

A. Rounding

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Vasya has a non-negative integer n. He wants to round it to nearest integer, which ends up with 0. If n already ends up with 0, Vasya considers it already rounded.

For example, if n = 4722 answer is 4720. If n = 5 Vasya can round it to 0 or to 10. Both ways are correct.

For given n find out to which integer will Vasya round it.

Input

The first line contains single integer n (0 ≤ n ≤ 109) — number that Vasya has.

Output

Print result of rounding n. Pay attention that in some cases answer isn't unique. In that case print any correct answer.

Examples

input

5

output

0

input

113

output

110

input

1000000000

output

1000000000

input

5432359

output

5432360

Note

In the first example n = 5. Nearest integers, that ends up with zero are 0 and 10. Any of these answers is correct, so you can print 0 or 10.

代码：

#include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<queue>
#include<cstring>
#include<map>
using namespace std;
typedef long long ll;
#define M 400005

int n;

int main()
{

    scanf("%d",&n);
    if(n%10==0)
    {
        cout<<n<<endl;
    }else{
        int tn=n;
        if(tn<10)
        {
            if(tn<=5)
                cout<<0<<endl;
            else
                cout<<10<<endl;
                return 0;
        }

        int t=tn%10;
        if(t<=5)
        {
            tn=tn/10;
            tn=tn*10;
        }
        else
        {
            tn=tn/10;
            tn=tn+1;
            tn=tn*10;
        }
        cout<<tn<<endl;
    }
    return 0;
}

B. Proper Nutrition

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Vasya has n burles. One bottle of Ber-Cola costs a burles and one Bars bar costs b burles. He can buy any non-negative integer number of bottles of Ber-Cola and any non-negative integer number of Bars bars.

Find out if it's possible to buy some amount of bottles of Ber-Cola and Bars bars and spend exactly n burles.

In other words, you should find two non-negative integers x and y such that Vasya can buy x bottles of Ber-Cola and y Bars bars and x·a + y·b = n or tell that it's impossible.

Input

First line contains single integer n (1 ≤ n ≤ 10 000 000) — amount of money, that Vasya has.

Second line contains single integer a (1 ≤ a ≤ 10 000 000) — cost of one bottle of Ber-Cola.

Third line contains single integer b (1 ≤ b ≤ 10 000 000) — cost of one Bars bar.

Output

If Vasya can't buy Bars and Ber-Cola in such a way to spend exactly n burles print «NO» (without quotes).

Otherwise in first line print «YES» (without quotes). In second line print two non-negative integers x and y — number of bottles of Ber-Cola and number of Bars bars Vasya should buy in order to spend exactly n burles, i.e. x·a + y·b = n. If there are multiple answers print any of them.

Any of numbers x and y can be equal 0.

Examples

input

7
2
3

output

YES
2 1

input

100
25
10

output

YES
0 10

input

15
4
8

output

NO

input

9960594
2551
2557

output

YES
1951 1949

Note

In first example Vasya can buy two bottles of Ber-Cola and one Bars bar. He will spend exactly 2·2 + 1·3 = 7 burles.

In second example Vasya can spend exactly n burles multiple ways:

• buy two bottles of Ber-Cola and five Bars bars;
• buy four bottles of Ber-Cola and don't buy Bars bars;
• don't buy Ber-Cola and buy 10 Bars bars.

In third example it's impossible to but Ber-Cola and Bars bars in order to spend exactly n burles.

本来想到应该暴力就好，但是感觉拓展欧几里得好像能做，想了半天没想出来，还是暴力吧

代码：

#include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<queue>
#include<cstring>
#include<map>
using namespace std;
typedef long long ll;
#define M 400005

int n,a,b;

int gcd(int a,int b)
{
    return b==0?a:gcd(b,a%b);
}

int main()
{

    scanf("%d%d%d",&n,&a,&b);
    int gc=gcd(a,b);
        //int x,y;
        //extend_Euclide(a,b,x,y);
        int t=gcd(gc,n);
        n=n/t;
        a=a/t;
        b=b/t;
        int x,y;
        int ans1,ans2;
        bool flag=false;
        for(x=0;a*x<=n;x++)
        {
            y=n-a*x;
            if(y%b==0)
            {
                ans1=x;
                ans2=y/b;
                flag=true;
                break;
            }
        }
        if(flag){
            cout<<"YES"<<endl;
            cout<<ans1<<" "<<ans2<<endl;
        }
        else{
            cout<<"NO"<<endl;
        }
    return 0;
}