#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int N = 100005;
int dx[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dy[] = {-1, 0, 1, -1, 1, -1, 0, 1};
void testCase() {
  int n, a, b;
  cin >> n >> a >> b;
  if (n % a == 0) {
    cout << "YES\n" << n / a << " 0";
    return;
  } else if (n % b == 0) {
    cout << "YES\n0 " << n / b;
    return;
  } else {
    for (int y = 1; y <= (n - a) / b; y++) {
      int x = (n - y * b) / a;
      if ((x * a + y * b) == n) {
        cout << "YES\n" << x << " " << y;
        return;
      }
    }
  }
  cout << "NO";
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t != 0) {
    t--;
    testCase();
  }
  return 0;
}
