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])
	}

}

C++: #include <bits/stdc++.h>

#define rep_(v, f, l) for (int v = (f); v < (l); ++v)
#define rep(v, n) rep_(v, 0, n)
#define lep(v, n) rep_(v, 1, n + 1)

using namespace std;

typedef long long int lint;

static inline int in(){ int x; scanf("%d", &x); return x; }
static inline lint inl(){ lint x; scanf("%lld", &x); return x; }

int main()
{
    int a, b;

    while (~scanf("%d %d", &a, &b)){
        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 <stdio.h>
main(){

int A,B;

while(scanf("%d %d",&A,&B) != EOF){

printf("%d",A + B);

}

}

C++: #include<bits/stdc++.h>

using namespace std ;

int main(void)
{
    int a, b ;
    while(~scanf("%d%d",&a ,& b )){
        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>

using namespace std;

int main(void){
  for(int a, b; cin >> a >> b; cout << a + b << endl);
  
  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>
using namespace std;

int main(){
  int A, B;
  while (cin) {
    cin >> A >> B;
    cout << A+B << '\n';
  }

}

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

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
#define FOR(i,a,b) for(int i=(a);i<(int)(b);i++)
#define rep(i,n) FOR(i,0,n)
#define ALL(x) (x).begin(),(x).end()
#define pb push_back
#define vint vector<int>


int main(){
    int a,b;
    while(~scanf("%d%d",&a,&b)) cout << a+b << endl;

    return 0;
}

C++: #include <cstdio>
using namespace std;
int main(int argc, const char * argv[])
{

    // insert code here...
    int a, b;
    while(scanf("%d %d", &a, &b) != 0)
    {
        printf("%d\n", a + b);
    }
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

const int depth = 2, width = 4;
const int siz[depth + 1] = {2, 4, 1};
double matrix[depth][width][width] = {1.815155022, 0.9025716449, -1.09382462, -0.3875933114, -0.6446463742, -2.024756527, 0.3884682393, 0.8694956143, 0, 0, 0, 0, 0, 0, 0, 0, 0.9463118678, 0, 0, 0, -0.7951753672, 0, 0, 0, -1.570363939, 0, 0, 0, 1.851690207, 0, 0, 0};
double node[depth + 1][width];
double calc(double a, double b){
    memset(node, 0x00, sizeof(node));
    node[0][0] = a;
    node[0][1] = b;
    for(int i = 0; i < depth; i++){
        const auto from = node[i], to = node[i + 1];
        const auto h = siz[i], w = siz[i + 1];
        const auto m = matrix[i];
        for(int i = 0; i < h; i++) for(int j = 0; j < w; j++) to[j] += from[i] * m[i][j];
        if(i + 1 != depth) for(int j = 0; j < w; j++) if(to[j] < 0) to[j] = 0;
    }
    return node[depth][0];
}
int main(){
    int a, b;
    while( scanf("%d %d", &a, &b) != EOF ){
        printf("%ld\n", lround(calc(a, b)));
    }
}

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<stdio.h>

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<bits/stdc++.h>
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 a,b;
while(cin>>a){
cin>>b;
cout<<a+b<<endl;
}
return 0;
}

C++: #include <iostream>
int a,b;
int main(){
while(std::cin>>a>>b){
int c=0;
for(int i=0;i<1e7;i++)c++;
std::cout<<a+b+c/1e9<<std::endl;
}
}

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

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

C++: hello world

C++: /*
 * $File: p1000.cpp
 * $Author: Wayne <tletletle@163.com>
 *
 * Task:
 *   Compute A + B.
 * 
 * Solution:
 *   Straight forward.
 *   Remember to process to EOF.
*/

#include <cstdio>

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

C++: #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<char, int>P;

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

C++: // AOJ 1000
#include<cstdio>

int main()
{
	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 l,r;
	while(scanf("%d %d", &l, &r) != EOF){
		printf("%d\n", l+r);
	}
	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>
using namespace std;
int main() {
    cin.tie(0);
   	ios::sync_with_stdio(false);

    int a,b;
    while(cin >> a >> b){
        cout << a + b << "\n";
    }
	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>

using namespace std;

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

C++: #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<cmath>
#include<map>
#include<list>
#include<set>
using namespace std;

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

C++: #import <iostream>
int main(){int a,b; std::cin>>a>>b;std::cout<<a+b<<'\n';}

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

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

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

int main()
{
	int n,m;
	while(cin >>n && cin >> m){
		cout << n+m << endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
int main(void){
    int a,b;
    while (cin>>a>>b) {
        cout<<a+b<<endl;
    }
}

C++: #include <iostream>
long long a,b;
int main(){
while(std::cin>>a>>b){
long long c=0;
while(c<10000000000LL)c++;
std::cout<<(a+b+c)%c<<std::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);
    }
    return 0;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>

using namespace std;

#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define fi first
#define se second

#define PI acos(-1.0)
#define INF 1000000007
#define EPS 1e-10

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<double, double> PD;
typedef pair<string, ll> PS;
typedef vector<ll> V;

int a, b;

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