#include <bits/stdc++.h>
 
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
 
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)
 
#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
 
// #define DEBUG
 
#ifdef DEBUG
    #define dump(...) fprintf(stderr, __VA_ARGS__)
#else
    #define dump(...)
#endif
 
template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}
 
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
 
const double EPS = 1e-10;
const double PI = acos(-1.0);
const ll inf =1LL << 62;
const ll mod=1000000007LL;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
 
 
ll extgcd(ll a,ll b,ll& x,ll& y){x=1,y=0;ll g=a;if(b!=0) g=extgcd(b,a%b,y,x),y-=a/b*x;return g;}
ll ADD(const ll &a, const ll &b,const ll &mod) { return (a+b)%mod;}
ll SUB(const ll &a, const ll &b,const ll &mod) { return (a-b+mod)%mod;}
ll MUL(const ll &a, const ll &b,const ll &mod) { return (1LL*a*b)%mod;}
ll DIV(const ll &a, const ll &b,const ll &mod) {ll x,y; extgcd(b,mod,x,y);return MUL(a,(x+mod)%mod,mod);}
 
random_device rd;
mt19937 mt(rd());
uniform_int_distribution<int> dice(1,6);
uniform_real_distribution<double> score(0.0,10.0);
 
using vvi = vector<vi>;

int h = 4, w = 8;

bool check(vvi & board){
    rep(y, h){
        rep(x, w - 1){
            if(board[y][x] != 10 * (y + 1) + (x + 1)) return false;
        }
    }

    return true;
}

int main(void){
    int T; cin >> T;

    while(T--){
        vvi board(h, vi(w));
        rep(y, h){
            rep(x, 1, w){
                cin >> board[y][x];
                if(board[y][x] % 10 == 1){
                    board[y][x] = 0;
                }
            }
        }
        rep(y, h) board[y][0] = 10 * (y + 1) + 1;

        queue<pair<int, vvi>> q;
        map<vvi, bool> used;
        q.push(make_pair(0, board));

        int res = -1;
        while(q.size()){
            vvi cboard = q.front().second;
            int ccost  = q.front().first;
            q.pop();

            if(used[cboard]) continue;
            used[cboard] = true;

            bool ch = false;
            rep(y, h){
                rep(x, 1, w){
                    if(cboard[y][x] != 0 or cboard[y][x - 1] % 10 == 7) continue;

                    [&]{
                        rep(yy, h){
                            rep(xx, w){
                                if(cboard[yy][xx] == cboard[y][x - 1] + 1){
                                    swap(cboard[yy][xx], cboard[y][x]);
                                    if(not used[cboard]){
                                        q.push(make_pair(ccost + 1, cboard));
                                        ch = true;
                                    }
                                    swap(cboard[yy][xx], cboard[y][x]);
                                }
                            }
                        }
                    }();
                }
            }

            if(not ch and check(cboard)){
                res = ccost;
                break;
            }
        }

        cout << res << endl;
    }

    return 0;
}

Measured memory_bytes: 27984