#include <iostream>

 #include <cstdio>

 #include <sstream>

 #include <algorithm>

 #include <vector>

 #include <cmath>

 using namespace std;

 const int INF = 0x3f3f3f3f;

 bool in[];

 int t, n, num[];

 string s;

 stringstream ss;

 int minn = INF;

 int main()

 {

     cin >> t;

     getchar();

     while (t--)

     {

         getline(cin, s);

         ss.clear();

         n = ;

         minn = INF;

         ss << s;

         while (ss >> num[n++]);

         n--;

         if (n == )

         {

             cout << abs(num[] - num[]) << endl;

             continue;

         }

         do

         {

             int x = , y = , z = ;

             for (int i = ; i < n / ; i++)

             {

                 x += num[i];

                 if (i != n /  - )

                     x *= ;

             }

             for (int i = n / ; i < n; i++)

             {

                 y += num[i];

                 if (i != n - )

                     y *= ;

                 if (i == n / )

                     continue;

                 z += num[i];

                 if (i != n - )

                     z *= ;

             }

             if (!(n >  && num[] ==  || num[n / ] == ))

                 minn = min(minn, abs(x - y));

             if (n &  && !(num[] ==  || n >  && num[n /  + ] == ))

                 minn = min(minn, abs(x *  + num[n / ] - z));

         } while (next_permutation(num, num + n));

         cout << minn << endl;

     }

     return ;

 }