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.
import java.util.*;

public class BProperNutrition{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int x = sc.nextInt();
	int a = sc.nextInt();
	int b =sc.nextInt();
	int ca=0;
	int cb=0;
	boolean valid = false;
            if(x%a==0){
		ca = x/a;
                valid=true;
            }else if(x%b==0){
		cb = x/b;
		valid = true;
	    }else{
                while(true){
                   if(x==0){
			valid = true;
			   break;
		   }else if(x>0 && x%a==0){
			ca+=(x/a);
			valid = true;
			break;
		   }else if(x>0 && x%b==0){
			cb+=(x/b);
			valid = true;
			break;
		   }			   
                    else{
			if(x>0){
				x-=a;ca++;
				if(x==0){
			valid = true;
			   break;
		   }else if(x>0 && x%a==0){
			ca+=(x/a);
			valid = true;
			break;
		   }else if(x>0 && x%b==0){
			cb+=(x/b);
			valid = true;
			break;
		   }
				x-=b;cb++;
				if(x==0){
			valid = true;
			   break;
		   }else if(x>0 && x%a==0){
			ca+=(x/a);
			valid = true;
			break;
		   }else if(x>0 && x%b==0){
			cb+=(x/b);
			valid = true;
			break;
		   }
			}
			else{
				valid = false;
				break;
			}
                    }
                }
            }
	    if(valid){
		System.out.println("YES");
		System.out.print(ca+" ");
		System.out.println(cb);
	    }
	    else
		    System.out.println("NO");
    }
}