#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000010;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long extend_gcd(long long a, long long b, long long &P, long long &Q) {
  long long d = a;
  if (b != 0) {
    d = extend_gcd(b, a % b, Q, P);
    Q -= (a / b) * P;
  } else {
    P = 1;
    Q = 0;
  }
  return d;
}
int main(int argc, char const *argv[]) {
  long long n, a, b;
  scanf("%I64d%I64d%I64d", &n, &a, &b);
  bool flg = false;
  long long x, y;
  for (int i = 0; i <= n; i++) {
    if (n - (a * i) < 0) break;
    if ((n - (a * i)) % b == 0) {
      x = i;
      y = (n - a * i) / b;
      flg = true;
      break;
    }
  }
  if (flg) {
    printf("YES\n");
    printf("%I64d %I64d\n", x, y);
  } else
    printf("NO\n");
  return 0;
}
