#include <bits/stdc++.h>
long long int xGCD(long long int a, long long int b, long long int &x,
                   long long int &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  long long int x1, y1, gcd = xGCD(b, a % b, x1, y1);
  x = y1;
  y = x1 - (a / b) * y1;
  return gcd;
}
using namespace std;
long long int n = 0, a, b, m = 0, k = 0, ans = 0, res = 0, sum = 0;
vector<vector<long long int>> g;
vector<long long int> arr;
int main() {
  cin >> n >> a >> b;
  long long int x, y;
  long long int gcd = xGCD(a, b, x, y);
  if (n % gcd != 0) {
    cout << "NO" << endl;
    return 0;
  }
  int i = 0;
  if (n % b == 0) {
    cout << "YES" << endl;
    cout << 0 << " " << n / b;
    return 0;
  }
  while (n - b * i >= 0) {
    if ((n - b * i) % a == 0) {
      cout << "YES" << endl;
      cout << (n - b * i) / a << " " << i;
      return 0;
    }
    i++;
  }
  cout << "NO";
  return 0;
}
