#include <bits/stdc++.h>
const long long mod = 1e9 + 7;
using namespace std;
long long powermod(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = (ans * a) % mod;
    b = b / 2;
    a = (a * a) % mod;
  }
  return ans;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; }
void solution(long long a, long long b, long long n) {
  for (long long i = 0; i * a <= n; i++) {
    if ((n - (i * a)) % b == 0) {
      cout << "YES\n";
      cout << i << " " << (n - (i * a)) / b;
      return;
    }
  }
  cout << "NO\n";
}
void Arise() {
  long long n;
  long long a, b;
  cin >> n >> a >> b;
  solution(a, b, n);
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  while (t--) {
    Arise();
  }
}
