#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b, long long int& x,
                  long long int& y) {
  if (a == 0) {
    x = 0;
    y = 1;
    return b;
  }
  long long int x1, y1;
  long long int d = gcd(b % a, a, x1, y1);
  x = y1 - (b / a) * x1;
  y = x1;
  return d;
}
bool find_any_solution(long long int a, long long int b, long long int c,
                       long long int& x0, long long int& y0, long long int& g) {
  g = gcd(abs(a), abs(b), x0, y0);
  if (c % g != 0) return false;
  x0 *= c / g;
  y0 *= c / g;
  if (a < 0) x0 *= -1;
  if (b < 0) y0 *= -1;
  return true;
}
int main() {
  long long int a, b, c;
  cin >> c >> a >> b;
  long long int x = 0, y = 0, g = 0;
  if (find_any_solution(a, b, c, x, y, g)) {
    const long long int c_x = x;
    const long long int c_y = y;
    if (x < 0) {
      for (long long int i = 0; x < 0; ++i) {
        x = c_x + i * b / g;
        y = c_y - i * a / g;
      }
    } else if (y < 0) {
      for (long long int i = 0; y < 0; --i) {
        x = c_x + i * b / g;
        y = c_y - i * a / g;
      }
    }
    if (x < 0 || y < 0)
      cout << "NO\n";
    else
      cout << "YES\n" << x << " " << y << "\n";
  } else
    cout << "NO\n";
  return 0;
}
