#include <iostream>
#include <stack>
#include <cmath>
#include <vector>
#include <string.h>
#include <queue>
#include <stdio.h>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#define int long long
using namespace std;
const int N = 1e5 + 10;
const int INF = 0x3f3f3f3f;
signed main()
{
	int n;
	int a, b;
	cin >> n;
	for(int i = 1; i <= n; i++)
	{
		cin >> a >> b;
		cout << a + b << endl;
	}
	return 0;
}

#include

using namespace std;

int main() {

int n,a,b;

cin>>n;

for(int i=1;i<=n;i++){

cin>>a>>b;

cout<<a+b<<endl;

}

}

#include<cstdio>
int a,b,n;
signed main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d%d",&a,&b);
		printf("%d\n",a+b);
	}
	return 0;
}

#include <bits/stdc++.h>
using namespace std;
int main(){
    int a,d,e;
    int b[114514],c[114514];
    cin>>a;
    for(int i=0;i<a;i++){
        cin>>d>>e;
        b[i] = d;
        c[i] = e;
    }
    for(int i=0;i<a;i++){
        cout<<b[i]+c[i]<<endl;
    }



}

#include<bits/stdc++.h> using namespace std; int main() { int a,b,n; cin>>n; for(int i=1; i<=n; i++) { cin>>a>>b; cout<<a+b<<endl; } return 0; }

#include #include #include #include #include #include #include #include #include #define LL long long using namespace std; const int INF = 0x3f3f3f3f; const int N = 1e5 + 10; int main() { int n , a , b; cin >> n; for(int i=1;i<=n;i++) { cin>>a>>b; cout<<a+b<<endl; } return 0； }

#include <stdio.h> #include #include <math.h> using namespace std; int main() { int T,a,b; cin >> T; while(T--) { cin >> a >> b; cout << a+b << endl; } }

#include <stdio.h> #include #include <math.h> using namespace std; int main() { int T,a,b; cin >> T; while(T--) { cin >> a >> b; cout << a+b << endl; } }

··· #include<stdio.h> #include using namespace std; int main() { int T; cin>>T; while(T--) { int a,b; cin>>a>>b; cout<<a+b<<endl; } } ···