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

template<typename F, typename S>
ostream &operator<<(ostream &os, const pair<F, S> &p) {
    return os << "(" << p.first << ", " << p.second << ")";
}

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    os << "{";
    typename vector<T>::const_iterator it;
    for (it = v.begin(); it != v.end(); it++) {
        if (it != v.begin()) os << ", ";
        os << *it;
    }
    return os << "}";
}

template<typename T>
ostream &operator<<(ostream &os, const set<T> &v) {
    os << "[";
    typename set<T>::const_iterator it;
    for (it = v.begin(); it != v.end(); it++) {
        if (it != v.begin()) os << ", ";
        os << *it;
    }
    return os << "]";
}

template<typename F, typename S>
ostream &operator<<(ostream &os, const map<F, S> &v) {
    os << "[";
    typename map<F, S>::const_iterator it;
    for (it = v.begin(); it != v.end(); it++) {
        if (it != v.begin()) os << ", ";
        os << it->first << " = " << it->second;
    }
    return os << "]";
}

#define debug(x) cerr << #x << " = " << x << endl;
#define trace1(x)                cerr<<#x<<": "<<x<<endl
#define trace2(x, y)             cerr<<#x<<": "<<x<<" | "<<#y<<": "<<y<<endl
#define trace3(x, y, z)          cerr<<#x<<":" <<x<<" | "<<#y<<": "<<y<<" | "<<#z<<": "<<z<<endl
#define trace4(a, b, c, d)       cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<endl
#define trace5(a, b, c, d, e)    cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<" | "<<#e<< ": "<<e<<endl
#define trace6(a, b, c, d, e, f) cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<" | "<<#e<< ": "<<e<<" | "<<#f<<": "<<f<<endl


typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long int> vll;
typedef pair<int, int> pii;
typedef pair<long long int, long long int> pll;
typedef map<int, int> mii;
typedef vector< pair<int, int> > vpii;

#define endl "\n";
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(),(c).end()
#define tr(cont, it) for(decltype((cont).begin()) it = (cont).begin(); it != (cont).end(); it++)
#define present(c, x) ((c).find(x) != (c).end())
#define cpresent(c, x) (find(all(c),x) != (c).end())
#define F first
#define S second


const ld PI=acos(-1.0);
const ll mod = 1000000007;
const ll inf = (ll) 1e15;

ll power(ll a, ll b, ll m = mod) {if (b == 0) return 1; if (b == 1) return (a % m); ll x = power(a, b / 2, m); x = (x * x) % m; if (b % 2) x = (x * a) % m;return x;}
ll max(ll a, ll b) { return (a > b ? a : b); }
ll min(ll a, ll b) { return (a < b ? a : b); }

const int N=1e5+5;
const int M=1e5+5;

void solve() {

    int a1[11]={0},a2[11]={0},a3[11]={0};
    int c1=0,c2=0,c3=0;
    string s1,s2,s3;
    cin >> s1 >> s2 >> s3;
    for(int i=0;i<10;i++)
    {
        if(s1[i]=='1')
            c1++;
        if(s2[i]=='1')
            c2++;
        if(s3[i]=='1')
            c3++;
    }
    set<int> s;
    for(int i=1;i<=c1;i++)
    {
        a1[i]=1;
        s.insert(i);
    }
    bool used1[11]={false};
    for(int i=c1+1;c2>0&&i<=10;i++)
    {
        used1[i]=true;
        a2[i]=1;
        s.insert(i);
        c2--;
    }
    if(c2>0)
    {
        while(c2>0)
        {
            int torem=-1;
            for(auto it : s)
            {
                if(used1[it]== false)
                    torem=it;
            }
            s.erase(torem);
            used1[torem]=true;
            c2--;
        }
    }

    assert(c2==0);

    bool used[11]={false};
    for(int i=1;c3>0&&i<=10;i++)
    {
        if(s.find(i)!=s.end())
            continue;
        used[i]=true;
        s.insert(i);
        c3--;
    }
    if(c3>0)
    {
        while(c3>0)
        {
            int torem=-1;
            for(auto it : s)
            {
                if(used[it]== false)
                    torem=it;
            }
            s.erase(torem);
            used[torem]=true;
            c3--;
        }
    }

    assert(c3==0);

   // debug(s);
    string ans="";
    for(int i=1;i<=10;i++)
    {
        int p=0;
        if(s.find(i)!=s.end())
            p=1;
        ans+=(char)(p+'0');
    }
    sort(ans.begin(),ans.end());
    reverse(ans.begin(),ans.end());
    cout << ans << endl;

}

int main() {
    IOS;
    int t = 1, num = 1;   ///// change this t for number of testcase globally
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}