#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))

using namespace std;

const ll INF=1e9;

int main(){
    vector<ll> a(3),b(3),e(3),d(3);
    rep(i,3){
        cin >> a[i];
        b[i]=a[i];
    }
    rep(i,3){
        cin >> d[i];
        e[i]=d[i];
    }
    sort(b.begin(),b.end());
    sort(e.begin(),e.end());
    bool ok=true;
    rep(i,3){
        if(b[i]!=e[i]) ok=false;
    }
    if(!ok) cout << "No" << endl;
    else{
        ll cnt=0;
        rep(i,3){
            if(a[i]!=d[i]) cnt++;
        }
        if(cnt==0) cout << "Yes" << endl;
        if(cnt==2){
            cout << "Yes" << endl;
            rep(i,3){
                if(a[i]==d[i]){
                    cout << 2 << endl;
                }
            }
        }
        if(cnt==3){
            cout << "Yes" << endl;
            ll pos=-1;
            rep(i,3){
                if(i){
                    if(a[i]==d[0]){
                        pos=i;
                        break;
                    }
                }
            }
            cout << 2  << endl;
            cout << 2  << endl;
        }
    }
    return 0;
}