#include <bits/stdc++.h>
using namespace std;
template <typename T1, typename T2>
bool Max(T1& a, T2 b) {
  return a < b ? a = b, 1 : 0;
}
template <typename T1, typename T2>
bool Min(T1& a, T2 b) {
  return a > b ? a = b, 1 : 0;
}
template <class T>
T gcd_ext(T a, T b, T& x, T& y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  T g = gcd_ext(b, a % b, y, x);
  y -= (a / b) * x;
  return g;
}
const int N = 200001;
int a[N];
void solve() {
  long long n, a, b, x, y;
  cin >> n >> a >> b;
  int gcd = gcd_ext(a, b, x, y);
  if (n % gcd) {
    cout << "NO" << '\n';
    return;
  }
  n /= gcd;
  x *= n;
  y *= n;
  if (x < 0) {
    long long t = (-x + b - 1) / b;
    x += t * b;
    y -= t * a;
  } else if (y < 0) {
    long long t = (-y + a - 1) / a;
    y += t * a;
    x -= t * b;
  }
  if (x < 0 || y < 0) {
    cout << "NO" << '\n';
    return;
  }
  cout << "YES" << '\n';
  cout << x << ' ' << y << '\n';
}
void init() {}
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.setf(ios::fixed);
  cout.precision(20);
  init();
  int TC = 1;
  for (int TI = 1; TI <= (int)(TC); ++TI) {
    solve();
  }
  return 0;
}
