#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int D, E, F;

bool flag = false;
string sovle(int a, int b, int c) {
    string t = "";
    flag = false;
    while (true) {
        if (2 * a <= D && 2 * b <= E) {
            a *= 2;
            b *= 2;
            if (t.length() == 0) {
                t = "2 F 2 F";
            } else {
                t += " 2 F 2 F";
            }
        } else {
            break;
        }
    }
    while (true) {
        if (2 * a <= D && 2 * c <= F) {
            a *= 2;
            c *= 2;
            if (t.length() == 0) {
                t = "2 E 2 E";
            } else {
                t += " 2 E 2 E";
            }
        } else {
            break;
        }
    }
    while (true) {
        if (2 * b <= E && 2 * c <= F) {
            b *= 2;
            c *= 2;
            if (t.length() == 0) {
                t = "2 D 2 D";
            } else {
                t += " 2 D 2 D";
            }
        } else {
            break;
        }
    }
    if (a == D && b == E && c == F) {
        flag = true;
    }
    return t;
}


int main() {
    int x[3], y[3];
    for (int i = 0; i < 3; i++) {
        cin >> x[i];
    }
    cin >> D >> E >> F;
    vector<int> v{0, 1, 2};
    string best = string(100, 'a');
    do {
        string t = sovle(x[v[0]], x[v[1]], x[v[2]]);
        int id[3];
        for (int i = 0; i < 3; i++) {
            id[i] = v[i];
        }
        string s = "";
        if (id[0] != 0 && id[1] != 1) {
            s = "1 C";
            swap(id[0], id[1]);
        }
        if (id[0] != 0 && id[2] != 2) {
            s = "1 B";
            swap(id[0], id[2]);
        }
        if (id[1] != 1) {
            if (s.length() == 0) {
                s = "1 A";
            } else {
                s += " 1 A";
            }
        }
        if (s.length() == 0) {
            if (flag) {
                if (best.length() < t.length()) {
                    best = t;
                }
            }
        } else {
            if (flag) {
                if (t.length() == 0) {
                    if (best.length() > s.length()) {
                        best = s;
                    }
                } else {
                    if (best.length() < t.length() + s.length()) {
                        best = s + " " + t;
                    }
                }
            }
        }
    } while (next_permutation(v.begin(), v.end()));
    if (best.length() == 100) {
        cout << "No\n";
    } else {
        cout << "Yes\n";
        cout << best << "\n";
    }
    return 0;
}