#include <bits/stdc++.h>
template<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}
template<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define mod (ll)(1e9+7)
#define inf (ll)(3e18+7)
#define eps (double)(1e-9)
#define pi (double) acos(-1)
#define P pair<int,int>
#define PiP pair<int,pair<int,int>>
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
using namespace std;

bool solve1(ll a){
    while(a % 2 == 0)a /= 2;
    return (a == 1);
}

ll solve2(ll a){
    ll ret = 0;
    while(a % 2 == 0){
        a /= 2;
        ret++;
    }
    return ret;
}

int main() {
    vector<P> a(3);  
    ll d, e, f;
    cin >> a[0].first >> a[1].first >> a[2].first >> d >> e >> f;
    a[0].second = 1;
    a[1].second = 2;
    a[2].second = 3;
    ll mn = inf;
    vector<pair<ll,ll>> ans;
    do{ 
        if(d % a[0].first)continue;
        if(e % a[1].first)continue;
        if(f % a[2].first)continue;
        if(!solve1(d/a[0].first) || !solve1(e/a[1].first) || !solve1(f/a[2].first))continue;
        ll x = solve2(d/a[0].first);
        ll y = solve2(e/a[1].first);
        ll z = solve2(f/a[2].first);
        vector<pair<ll, ll>> b = {{x, a[0].second}, {y, a[1].second}, {z, a[2].second}};
        sort(rall(b));
        if(b[0].first-b[1].first == b[2].first){
            ll cnt = 2*b[1].first + 2 * (b[0].first-b[1].first);
            if(a[0].second != 1 || a[1].second != 2 || a[2].second != 3){cnt++;}
            if(chmin(mn, cnt)){
                ans = b;
            }
        }
    }while(next_permutation(all(a)));
    if(mn != inf){
        cout << "Yes" << endl;
        rep(i, 2*ans[1].first)cout << 1 << " " << ans[2].second << endl;
        ans[0].first -= ans[1].first;
        rep(i, 2*ans[0].first)cout << 1 << " " << ans[1].second << endl;
        if(mn % 2)cout << 2 << endl;
    }else cout << "No" << endl;
}