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 B {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		long n = in.nextLong();
		long a = in.nextLong();
		long b = in.nextLong();
		
		long d = gcd(a, b);
		if (n % d != 0) {
			System.out.println("NO");
			System.exit(0);
		}
		
		long[] r = solveDiophantine(a, b, n);
		//System.out.printf("%d %d\n", r[0], r[1]);
		
		double x = ((double)r[0]) / (((double)b)/(double)d);
		double y = -1*(((double)r[1]) / (((double)a)/(double)d));
		
		long xi = 0;
		long yi = 0;
		if (x >= 0) {
			xi = (long)x;
		}
		else {
			xi = (long)Math.floor(x);
		}
		
		if (y < 0) {
			yi = (long)y;
		}
		else {
			yi = (long)Math.ceil(y);
		}
		
		if (yi > xi) {
			System.out.println("NO");
		}
		else {
			long xl = r[0] - ((b*xi) / d);
			long yl = r[1] + ((a*xi) / d);
			System.out.printf("YES\n%d %d\n", xl, yl);
		}
	}
	
	private static long gcd(long a, long b) {
		if (b == 0) {
			return a;
		}
		else {
			return gcd(b, a % b);
		}
	}
	
	/**
	* Finds a single solution {x, y} to the LDE a*x + b*y = c.
	* Outputs an array of the form {x, y, d}, where d = GCD(a,b).
	*/
	private static long[] solveDiophantine(long a, long b, long c) {
		long[] e = extEuclid(a, b);
		long k = c / e[2];
		//c not divisible by the GCD(a,b) -> no solution
		if (c - k*e[2] != 0)
			return null;
		long[] output = {e[0] * k, e[1] * k, e[2]};
		return output;	
	}

	/**
	* Extended Euclidean Algorithm finds {x, y, d}
	* where d=GCD(a,b) and x and y satisfy a*x + b*y = d
	* The output is an array of the form {x, y, d}.
	*/
	private static long[] extEuclid (long a, long b) {
		long s0 = 1, s1 = 0, sTemp;
		long t0 = 0, t1 = 1, tTemp;
		long r0 = a, r1 = b, rTemp;
		long q;
		while (r1 != 0) {
			q = r0 / r1;
			rTemp = r1;
			r1 = r0 - q*r1;
			r0 = rTemp;
			sTemp = s1;
			s1 = s0 - q*s1;
			s0 = sTemp;
			tTemp = t1;
			t1 = t0 - q*t1;
			t0 = tTemp;
		}
		long[] output = {s0, t0, r0};
		return output;
	}
}