#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <time.h>
#include <random>
#include <string>
#include <cassert>
#include <vector>
#include <ostream>
#include <istream>
#include <stack>
#include <deque>
#include <queue>
#include <functional>

using namespace std;

#define int long long
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define pii pair<int, int>
#define ld long double

ostream& operator << (ostream &a, const vector<int> &b) {
    for (auto k : b) cout << k << " ";
    return a;
}

#ifdef LOCAL
    #define dbg(x) cout << #x << " : " << (x) << "\n";
    const int INF = 1e9;
//    const int mod = 2600000069;
//    const int p = 10;
//    const ld PI = 3.1415926535;
#else
    #define dbg(x)
    const int INF = 1e9;
//    const int mod = 2600000069;
//    const int p = 179;
//    const ld PI = 3.1415926535;
#endif

//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,sse3,sse4")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("fast-math")
//#pragma GCC target("avx2")
//#pragma GCC optimize("section-anchors")
//#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
//#pragma GCC optimize("vpt")
//#pragma GCC optimize("rename-registers")
//#pragma GCC optimize("move-loop-invariants")
//#pragma GCC optimize("unswitch-loops")
//#pragma GCC optimize("function-sections")
//#pragma GCC optimize("data-sections")

const int MAXN = 5100;

int dp[MAXN];

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    #ifdef LOCAL
    #else
//        freopen("parens.in", "r", stdin);
//        freopen("parens.out", "w", stdout);
    #endif
    dp[0] = 0;
    dp[1] = 0;
    for (int i = 2; i < MAXN; i++) {
        for (int j = 1; j <= i / 2; j++) {
            if (!dp[i - j]) dp[i] = 1;
        }
    }
//    for (int i = 1; i < 50; i++) {
//        printf("% 3d : ", i);
//        cout << dp[i] << "\n";
//    }
    int a, b, c;
    cin >> a >> b >> c;
    if ((dp[a] + dp[b] + dp[c]) % 2) {
        if (dp[a]) {
            for (int i = 1; i <= a / 2; i++) {
                if (dp[a - i] == 0) {
                    cout << "YES\n";
                    cout << a - i << " " << b << " " << c << "\n";
                    return 0;
                }
            }
        }
        if (dp[b]) {
            for (int i = 1; i <= b / 2; i++) {
                if (dp[b - i] == 0) {
                    cout << "YES\n";
                    cout << a << " " << b - i << " " << c << "\n";
                    return 0;
                }
            }
        }
        if (dp[c]) {
            for (int i = 1; i <= c / 2; i++) {
                if (dp[c - i] == 0) {
                    cout << "YES\n";
                    cout << a << " " << b << " " << c - i << "\n";
                    return 0;
                }
            }
        }
    }
    cout << "NO\n";
}
/*

*/