b030621

//Nguyen Huu Hoang Minh
#include <bits/stdc++.h>
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define reset(x) memset(x, 0,sizeof(x))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define N 2005
#define remain(x) if (x > MOD) x -= MOD
#define ii pair<int, int>
#define iiii pair< ii , ii >
#define viiii vector< iiii >
#define vi vector<int>
#define vii vector< ii >
#define bit(x, i) (((x) >> (i)) & 1)
#define Task "test"
#define int long long

using namespace std;

typedef long double ld;
const int inf = 1e10;
const int minf = -1e10;

int t, h, m;
string s1, s2;

void readfile()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    if (fopen(Task".inp","r"))
    {
        freopen(Task".inp","r",stdin);
        //freopen(Task".out","w",stdout);
    }
    cin >> t;
}

int a,b;
char useless;

bool check(int x, int type)
{
    queue<int> st;
    int fir = x;
    while (x > 0)
    {
        int s = x%10;
        if (s != 0 && s != 1 && s != 2 && s != 5 && s != 8) return false;
        if (s==2) st.push(5);
        else if (s==5) st.push(2);
        else st.push(s);
        x = x/10;
    }
    if (fir < 10) st.push(0);
    int ans=st.front();
    st.pop();
    while (st.size())
    {
        int v = st.front();
        st.pop();
        ans = (ans*10)+v;
    }
    if (type==1 && ans >= m) return false;
    else if (type==2 && ans >= h) return false;
    return true;
}

void solve()
{
    cin >> h >> m;
    cin >> a >> useless >> b;
    while (1)
    {
        if (check(a,1) && check(b,2)) {
                if (a<10) cout << 0;
                cout << a;
                cout << useless;
                if (b < 10) cout << 0;
                cout << b;
                cout << endl;
                break;
        }
        else{
            if (b < m-1) b++;
            else if (b==m-1 && a != h-1){
                a++;
                b=0;
            }
            else if (b==m-1 && a==h-1){
                a=0;
                b=0;
            }
        }
    }
}

void proc()
{
    while (t--)
    {
        solve();
    }
}

signed main()
{
    readfile();
    proc();
    return 0;
}