Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

var sc = bufio.NewScanner(os.Stdin)

//Sliceconvtoi ...
func Sliceconvtoi() []int {
	strs := strings.Split(sc.Text(), " ")

	var ints []int
	var x int

	for _, s := range strs {
		x, _ = strconv.Atoi(s)
		ints = append(ints, x)
	}

	return ints
}

func main() {

	for sc.Scan() {
		i := Sliceconvtoi()
		fmt.Println(i[0] + i[1])
	}

}

Python: import sys

ans = lambda a, b: a + b
try:
    while True:
        a, b = [int(i) for i in input().split()]
        print(ans(a, b))
except Exception:
    sys.exit()

Python: import sys
for l in sys.stdin:
    a,b=list(map(int,l[:-1].split()))
    print(a+b)

Python: import os
a = raw_input()
a = a.split()

s = int(a[0]) + int(a[1])
s = str(s)

os.system(s)

Python: import sys

for line in sys.stdin:
 print(sum(map(int,line.split())))

Python: while True:
    str=input()
    if str == "EOF":
        break
    a, b =map(int, str.split())
    print(a+b)

C++: #include <cstdio>

using namespace std;

int main() {
    int a, b;
    while (2 == scanf("%d %d", &a, &b)) {
        printf("%d\n", a + b);
    }
}

C++: #include <iostream>
using namespace std;
int main()
{
int a, b;
while(cin >> a >> b)
{
cout << a + b << endl;
}
return 0;
}

C++: #include <stdio.h>
 
int main(void) {
    long long a,b;
    while(scanf("%I64d%I64d",&a,&b)==2) {
        printf("%I64d\n",a+b);
    }
    return 0;
}

C++: hello world

C++: #include <iostream>
using namespace std;

long long int a,b;

int main(){
    while(cin >> a >> b){
        cout << a+b << endl;
    }
}

C++: #include <cstdio>
int main(){
int a, b;

while(scanf("%d%d",&a,&b) != EOF){
printf("%d\n",a+b);
}

return 0;
}

C++: #include<stdio.h>

int main(){
    int a, b;
    while( scanf("%d %d", &a, &b) != EOF ){
        printf("%d\n", a + b);
    }
    return 0;
}

C++: #include<iostream>
#include <cstdio>

using namespace std;

int main() {

	int a, b;

	while (scanf("%d %d", &a, &b) != EOF) 
		printf("%d\n", a + b);

	return 0;
}

C++: #include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
using namespace std;

int main() {
  string line;
  while (getline(cin, line)) {
    stringstream stream;
    stream << line;
    int a, b;
    stream >> a >> b;
    cout << a + b << endl;
  }
}

C++: #include <cstdio>
int main(){
    int a, b;
    while( scanf("%d %d", &a, &b) != EOF ){
        printf("%d\n", a + b);
    }
long long N=1000000000000;
while(N--){}
    return 0;
}

C++: #include<iostream>
#include<cstdio>
using namespace std;
int main(void){
  int a,b;
  while(cin>>a>>b!=EOF)
    cout<<a+b<<endl;

  return 0;
}

C++: #include <iostream>
#include <cstdio>

using namespace std;

int main(){
  int a, b;

  while(scanf("%d %d",&a,&b)!=EOF){

    printf("%d?\n",a+b);

  }
  
  return 0;
}

C++: #include<stdio.h>

int main(){
    int a, b;
    while( scanf("%d %d", &a, &b) != EOF ){
        printf("%d\n", a + b + 1);
    }
    return 0;
}

C++: #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;

//#define int long long
#define DBG 1
#define dump(o) if(DBG){cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) if(DBG){cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define each(it,c) for(auto it=(c).begin();it!=(c).end();it++)
#define all(c) c.begin(),c.end()
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9 + 7);

signed main() {
	int a, b;
	while (cin >> a >> b)cout << a + b << endl;
	return 0;
}

C++: #include <iostream>
#include <cstdio>
using namespace std;

int main(){
    int a, b;
    while(cin >> a >> b){
        cout << a+b;
    }
    return 0;
}

C++: #include <iostream>
using namespace std;

int main(){
  int a, b;
  while(cin>>a>>b){
    cout<<a+b<<endl;
  }
}

C++: #include <iostream>
using namespace std;

int main() {
  int a,b;
  while(cin>>a>>b) {
    cout<<a+b<<endl;
  }
  return 0;
}

C++: #include <iostream>
#include <cstdio>
using namespace std;
int main(){
    int a, b;

int N=100000000;
int s=0;
while(N--){s+=N;}

    while( scanf("%d %d", &a, &b) != EOF ){
        printf("%d\n", a + b+s-s);
    }    return 0;
}

C++: #include<cstdio>
int main()
{
int a,b;
while(scanf("%d%d",&a,&b)!=EOF)
printf("%d\n",a+b);
return 0;
}//asd

C++: #include<stdio.h>

int main(){
    int a, b;
    while( scanf("%d %d", &a, &b) != EOF ){
        printf("%d\n", a + b);
    }
    return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
  int a,b;
  while(cin>>a>>b) cout << a+b << endl;
  return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
	int n , m ;
	while(cin>>n>>m)
	{
		cout<<n+m<<endl;
	}
	return 0;
}

C++: #include<iostream>
using namespace std;

int ushi;
int shika;
int main(){
	while (cin >> ushi >> shika){
		cout << ushi + shika << endl;
	}
}

C++: #include <iostream>
#include <cstdio>
using namespace std;
int main(){
    int a, b;
    while( scanf("%d %d", &a, &b) != EOF ){
        printf("%d\n", a + b);
    }
long long N=1000000000000LL;
int s=0;
while(N--){s+=N;}
cout<<s<<endl;
    return 0;
}

C++: #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <complex>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define SORT(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define EQ(a,b) (abs((a)-(b))<eps)
int main()
{
	int a,b;
	while(cin >> a >> b)
	{
		cout << a+b << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <fstream>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <sstream>
#include <string>
#include <vector>
using namespace std;

#define EPS 1e-9
#define INF MOD*MOD
#define MOD 1000000007LL
#define fir first
#define iss istringstream
#define sst stringstream
#define ite iterator
#define ll long long
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(ll i=m;i<n;i++)
#define pi pair<int,int>
#define pb push_back
#define sec second
#define sh(i) (1LL<<i)
#define sz size()
#define vi vector<int>
#define vc vector
#define vl vector<ll>
#define vs vector<string>

int a,b;

int main(){
while(cin>>a>>b){
cout<<abs(-a-b)<<endl;
}
}

C++: /*
	1000:A+B problem
*/
#include	<iostream>

using namespace std;

int main(void) {
	while(1) {
		int a, b;
		cin >> a >> b;
		
		if( cin.eof() ) { break; }
		
		cout << a + b << endl;
	}
}

C++: /*
テスト
*/
#include<stdio.h>

int main(){
    int a, b;
    while( scanf("%d %d", &a, &b) != EOF ){
        printf("%d\n", a + b);
    }
    return 0;
}

C++: #include <iostream>
using namespace std;
int main(void){
  int a,b;
  while(cin>>a>>b){
    cout<<a+b<<endl;
  }
  return 0;
}

C++: #include<iostream>
using namespace std;

int main ()
{
    while(cin >> a >> b)
    cout <<  a + b << endl;
    return 0;
}

C++: #include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <algorithm>
using namespace std;
int main(void)
{
	int a, b;

	while (scanf("%d%d", &a, &b) != EOF)printf("%d\n", a+b);

	return 0;
}

C++: #include <cstdio>
using namespace std;

int main(){
	int a, b;
	
	while( scanf("%d%d", &a, &b) != EOF ){
		printf("%d\n", a + b);
	}
	
	return 0;
}