#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int n, a, b;
bool dp[10010000];
int main() {
  cin >> n >> a >> b;
  dp[0] = true;
  for (int i = 1; i <= 10000010; ++i) {
    if (i >= a) {
      if (dp[i - a]) dp[i] = true;
    }
    if (i >= b) {
      if (dp[i - b]) dp[i] = true;
    }
  }
  if (dp[n]) {
    for (int i = 0; i <= 10000000; ++i) {
      if (n - a * i >= 0 && (n - a * i) % b == 0) {
        cout << "YES" << endl;
        cout << i << " " << (n - a * i) / b;
        return 0;
      }
    }
  } else {
    cout << "NO";
  }
  return 0;
}
