#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<ll> a(3), A;  
    ll d, e, f, cnt = 0;
    cin >> a[0] >> a[1] >> a[2] >> d >> e >> f;
    do{ 
        cnt++;
        if(d % a[0])continue;
        if(e % a[1])continue;
        if(f % a[2])continue;
        if(!solve1(d/a[0]) || !solve1(e/a[1]) || !solve1(f/a[2]))continue;
        ll x = solve2(d/a[0]);
        ll y = solve2(e/a[1]);
        ll z = solve2(f/a[2]);
        vector<ll> b = {x, y, z};
        sort(rall(b));
        if(b[0]-b[1] == b[2]){
            rep(i, b[1])cout << 1 << " " << 3 << endl;
            b[0] -= b[1];
            rep(i, b[0])cout << 1 << " " << 2 << endl;
            if(cnt != 1)cout << 2 << endl;
            return 0;
        }
    }while(next_permutation(all(a)));
    cout << "NO" << endl;
}