#include <bits/stdc++.h>
using namespace std;
const int P = 1e9 + 7, INF = 0x3f3f3f3f;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long qpow(long long a, long long n) {
  long long r = 1 % P;
  for (a %= P; n; a = a * a % P, n >>= 1)
    if (n & 1) r = r * a % P;
  return r;
}
long long inv(long long first) {
  return first <= 1 ? 1 : inv(P % first) * (P - P / first) % P;
}
inline int rd() {
  int first = 0;
  char p = getchar();
  while (p < '0' || p > '9') p = getchar();
  while (p >= '0' && p <= '9') first = first * 10 + p - '0', p = getchar();
  return first;
}
const int N = 1e6 + 50;
long long exgcd(long long a, long long b, long long &first, long long &second) {
  if (b == 0) {
    first = 1, second = 0;
    return a;
  }
  long long d = exgcd(b, a % b, second, first);
  second -= a / b * first;
  return d;
}
int main() {
  long long n, a, b, first, second;
  cin >> n >> a >> b;
  long long g = exgcd(a, b, first, second);
  if (n % g) return puts("NO"), 0;
  first *= n / g, second *= n / g;
  long long L = -first * g / b, R = second * g / a;
  for (int t = L - 10; t <= R + 10; ++t) {
    long long u = first + b * t / g;
    long long v = second - a * t / g;
    if (u >= 0 && v >= 0) {
      puts("YES");
      cout << u << ' ' << v << '\n';
      return 0;
    }
  }
  puts("NO");
}
