#include<iostream>
#include<algorithm>
#include<vector>
#include<cstring>
#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<tuple>
#include<deque>
#include<stack>
#include<sstream>
#include<limits.h>
using namespace std;
#define x64 long long
#define ull unsigned long long
#define __md ios_base::sync_with_stdio(false);cin.tie(NULL);
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define endl '\n'
#define mem(h,x) memset(h,x,sizeof h);
#define py cout<<"YES"<<endl;
#define pn cout<<"NO"<<endl;
#define PII pair<int,int>
#define PCS pair<char,int>
#define PSI pair<string,int>
#define PBS pair<bool,string>
#define PSS pair<string,string> 
int gcd(int a, int b){ return b?gcd(b, a%b):a;}
int lcm(int a, int b){ return a*b/gcd(a,b);}
int ne[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
//int nefire[8][2]={{0,1},{1,0},{0,-1},{-1,0},{-1,-1},{-1,1},{1,-1},{1,1}};
constexpr int N=1e4+5,mod=1e9+7;
map<int,int> mp;
void solve(){
    int n=32;
    x64 a[n];
    for(int i=0;i<n;i++) cin>>a[i];
    x64 x=a[0];
    int xi;
    sort(a,a+n);
    for(int i=0;i<n;i++){
        cout<<a[i]<<" ";
        if(x==a[i]){
            xi=i+1;
            break;
        }
    }
    cout<<endl<<"--"<<xi<<endl;
    if(xi<2)
        cout<<"32\n";
    else if(xi<4)
        cout<<"16\n";
    else if(xi<8)
        cout<<"8\n";
    else if(xi<16)
        cout<<"4\n";
    else if(xi<32)
        cout<<"2\n";
    else cout<<"1\n";
}
int main()
{
    __md
   int t;cin>>t;
   while(t--){
      solve();
   }
}