https://ac.nowcoder.com/acm/contest/338/G

题解：2的63幂刚刚好爆ll，那就祭出__int128吧

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
typedef __int128 lll;
const int N=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
ll t,n,m,k,q,ans;
char str;
void print(__int128 x)
{
    if(x<0){
        print("-");
        x=-x;
    }
    if (x>9) print(x/10);
    putchar('0'+x%10);
}
int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    while(~scanf("%lld",&t)){
        ll a,b,c,d;
        while(t--){
            scanf("%lld%lld%lld%lld",&a,&b,&c,&d);
            lll ans=(lll)a+(lll)b+(lll)c+(lll)d;
            print(ans);
            cout << endl;
        }
    }

    //cout << "Hello world!" << endl;
    return 0;
}