#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
#include <cstdint>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

const int INF=1001001001;
const int mod = 1000000007;

int main() {
  vector<int>p(3),q(3);
  cin>>p[0]>>p[1]>>p[2]>>q[0]>>q[1]>>q[2];
  vector<pair<int,int>>e(3);
  for(int i=0;i<3;i++){
    e[i]=make_pair(p[i],q[i]);
  }
  if(p[0]==p[1]&&p[1]==p[2]){cout<<"No"<<endl;return 0;}
  bool ok=true;
  for(int i=0;i<2;i++){
    if(p[i]!=q[i]&&p[i+1]!=q[i+1]){
      ok=false;
    }
  }
  if(!ok){
    cout<<2<<endl;
    sort(e.rbegin(),e.rend());
  }
  
  vector<int>k(3);
  for(int i=0;i<3;i++){
    while(p[i]<q[i]){
      p[i]*=2;
      k[i]++;
    }
    if(p[i]!=q[i]){cout<<"No"<<endl;return 0;}
  }
  int MAX=0,r=0,sum=0;
  for(int i=0;i<3;i++){
    sum+=k[i];
    if(MAX<k[i]){MAX=k[i];r=i;}
  }
  if(sum-MAX!=MAX){cout<<"No"<<endl;return 0;}

  for(int i=0;i<2;i++){
    if(k[i]==0){continue;}
    for(int j=0;j<k[i];j++){
      if(k[i+1]>0){
        int c=3;  
        cout<<1<<" "<<c<<endl<<1<<" "<<c<<endl;
        k[i+1]--;
      }
      else if(i==0&&k[i+2]>0){
        int c=2; 
        cout<<1<<" "<<c<<endl<<1<<" "<<c<<endl;
        k[i+2]--;
      }
    }
  }
  return 0;
}