#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <fstream>
#include <assert.h>
#include <random>
#include <list>
#include <cmath>
#include <chrono>
#include <random>

using namespace std;


/*
int higher_card[13][13][13][13][13];
int pair[13][13][13][13];
int two_pair[13][13][13][13];
int three[13][13][13];
int straight[10];
int flush[13][13][13][13][13];
int full[13][13];
int four[13][13];
int straigh_flush[13][13][13][13][13];
*/

int power[13][13][13][13][13][2];

int kek[200];
int unkek[200];

vector<int> v;
int ind = 0;

void go(int x)
{
    sort(v.begin(),v.end());
    do{
        power[v[0]][v[1]][v[2]][v[3]][v[4]][x] = ind;
    }while(next_permutation(v.begin(),v.end()));
    ++ind;
}

const vector<vector<int> > perms = {
    {0, 1, 2, 3, 4},
    {0, 1, 2, 3, 5},
    {0, 1, 2, 3, 6},
    {0, 1, 2, 4, 5},
    {0, 1, 2, 4, 6},
    {0, 1, 2, 5, 6},
    {0, 1, 3, 4, 5},
    {0, 1, 3, 4, 6},
    {0, 1, 3, 5, 6},
    {0, 1, 4, 5, 6},
    {0, 2, 3, 4, 5},
    {0, 2, 3, 4, 6},
    {0, 2, 3, 5, 6},
    {0, 2, 4, 5, 6},
    {0, 3, 4, 5, 6},
    {1, 2, 3, 4, 5},
    {1, 2, 3, 4, 6},
    {1, 2, 3, 5, 6},
    {1, 2, 4, 5, 6},
    {1, 3, 4, 5, 6},
    {2, 3, 4, 5, 6},
};

class hand{
public:
    vector<pair<char, char> > v;

    hand(char a,char b, char c,char d)
    {
        v.resize(7);
        v[0] = {a,b};
        v[1] = {c,d};
    }

    int rank(){
        int mx = 0;
        for (auto &p:perms){
            bool straight = (v[p[0]].second == v[p[1]].second) && (v[p[0]].second == v[p[2]].second) && (v[p[0]].second == v[p[3]].second) && (v[p[0]].second == v[p[4]].second);
            mx = max(mx, power[v[p[0]].first][v[p[1]].first][v[p[2]].first][v[p[3]].first][v[p[4]].first][straight]);
        }
        return mx;
    }

};

long long int gcd(long long int a, long long int b)
{
    if (!b)
        return a;
    return gcd(b,a%b);
}

int main()
{
    assert(perms.size() == 21);
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    kek['2'] = 0;unkek[0] = '2';
    kek['3'] = 1;unkek[1] = '3';
    kek['4'] = 2;unkek[2] = '4';
    kek['5'] = 3;unkek[3] = '5';
    kek['6'] = 4;unkek[4] = '6';
    kek['7'] = 5;unkek[5] = '7';
    kek['8'] = 6;unkek[6] = '8';
    kek['9'] = 7;unkek[7] = '9';
    kek['T'] = 8;unkek[8] = 'T';
    kek['J'] = 9;unkek[9] = 'J';
    kek['Q'] = 10;unkek[10] = 'Q';
    kek['K'] = 11;unkek[11] = 'K';
    kek['A'] = 12;unkek[12] = 'A';

    for (int i=0;i<13;i++){
        for (int j=0;j<i;j++){
            for (int k=0;k<j;k++){
                for (int l=0;l<k;l++){
                    for (int m=0;m<l;m++){
                        if (i-4 == m)
                            continue;
                        if (i == 12 && j == 3 && k == 2 && l == 1 && m == 0)
                            continue;
                        v = {i,j,k,l,m};
                        go(0);
                    }
                }
            }
        }
    }

    for (int i=0;i<13;i++)
    {
        for (int j=0;j<13;j++)
        {
            for (int k=0;k<j;k++)
            {
                for (int l=0;l<k;l++)
                {
                    if (i != j && i != k && i != j && i != l){
                        v = {i,i,j,k,l};
                        go(0);
                    }
                }
            }
        }
    }

    for (int i=0;i<13;i++)
    {
        for (int j=0;j<i;j++)
        {
            for (int k=0;k<13;k++)
            {
                if (i != k && j != k)
                {
                    v = {i,i,j,j,k};
                    go(0);
                }
            }
        }
    }

    for (int i=0;i<13;i++)
    {
        for (int j=0;j<13;j++)
        {
            for (int k=0;k<j;k++)
            {
                if (i!=j && i!=k)
                {
                    v = {i,i,i,j,k};
                    go(0);
                }
            }
        }
    }

    v = {12,3,2,1,0};
    go(0);
    for (int i=4;i<13;i++)
    {
        v = {i,i-1,i-2,i-3,i-4};
        go(0);
    }

    for (int i=0;i<13;i++){
        for (int j=0;j<i;j++){
            for (int k=0;k<j;k++){
                for (int l=0;l<k;l++){
                    for (int m=0;m<l;m++){
                        if (i-4 == m)
                            continue;
                        if (i == 12 && j == 3 && k == 2 && l == 1 && m == 0)
                            continue;
                        v = {i,j,k,l,m};
                        go(1);
                    }
                }
            }
        }
    }

    for (int i=0;i<13;i++)
    {
        for (int j=0;j<13;j++)
        {
            if (i!=j){
                v = {i,i,i,j,j};
                go(0);
            }
        }
    }

    for (int i=0;i<13;i++)
    {
        for (int j=0;j<13;j++)
        {
            if (i!=j){
                v = {i,i,i,i,j};
                go(0);
            }
        }
    }

    v = {12,3,2,1,0};
    go(1);
    for (int i=4;i<13;i++)
    {
        v = {i,i-1,i-2,i-3,i-4};
        go(1);
    }

    int t;
    cin >> t;
    while(t--)
    {
        set<pair<char,char> > deck_set;
        for (int i=0;i<13;i++)
        {
            for (int j=0;j<4;j++)
            {
                deck_set.insert({i,j});
            }
        }

        int w,m;
        cin >> w >> m;

        vector<char> input;

        for (int i=0;i<4;i++)
        {
            int a;
            char b;
            cin >> a >> b;
            b = kek[b];
            input.push_back(a);
            input.push_back(b);
            deck_set.erase({b,char(a)});
        }

        vector<pair<char,char> > deck(deck_set.begin(), deck_set.end());

        hand A(input[1], input[0], input[3], input[2]);
        hand B(input[5], input[4], input[7], input[6]);

        int win_a = 0, draw = 0, win_b = 0;


        for (int i=4;i<48;i++)
        {
            A.v[2]=deck[i];
            B.v[2]=deck[i];
            for (int j=3;j<i;j++)
            {
            A.v[3]=deck[j];
            B.v[3]=deck[j];
                for (int k=2;k<j;k++)
                {
            A.v[4]=deck[k];
            B.v[4]=deck[k];
                    for (int l=1;l<k;l++)
                    {
            A.v[5]=deck[l];
            B.v[5]=deck[l];
                        for (int z=0;z<l;z++)
                        {
            A.v[6]=deck[z];
            B.v[6]=deck[z];
                            int ra = A.rank();
                            int rb = B.rank();
                            if (ra > rb){
                                ++win_a;
                                //cout << "win_a ";
                                //for (auto x:A.v){
                                //    cout << unkek[x.first] << cdhs[x.second]
                                //}
                            }
                            else if (ra == rb)
                                ++draw;
                            else
                                ++win_b;
                        }
                    }
                }
            }
        }

        int total = win_a+win_b+draw;

        if (win_a == win_b) {
            cout << m+w << "/" << 1 << endl;
        } else if (win_a > win_b) {
            long long int fold = -w * 1ll * total;
            long long int all_in = (- w - m) * 1ll * (win_a - win_b);

            if (fold > all_in){
                cout << m+w+w << "/" << 1 << endl;
            } else {
                long long int nom = (m+w)*1ll*total + (m+w)*1ll*(win_a-win_b);
                long long int denom = total;
                long long g = gcd(nom, denom);
                cout << nom/g << "/" << denom/g << endl;
            }
        } else {
            long long int fold = -w * 1ll * total;
            long long int all_in = (- w - m) * 1ll * (win_b - win_a);


            if (fold > all_in){
                cout << m << "/" << 1 << endl;
            } else {
                long long int nom = (m+w)*1ll*total + (m+w)*1ll*(win_a-win_b);
                long long int denom = total;
                long long g = gcd(nom, denom);
                cout << nom/g << "/" << denom/g << endl;
            }
        }
    }

    return 0;
}