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 <iostream>
#include <sstream>
#include <algorithm>
#include <cmath>
#include <climits>
#include <string>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <assert.h>
#include <cstring>
using namespace std;
#define rep(i, n) for (int (i) = 0, j1234 = n; (i) < j1234; (i) ++)
#define rep1(i, n) for (int (i) = 1, j1234 = n; (i) <= j1234; (i) ++)
#define For(i, a, b) for (int (i) = (a), ub1234=b; (i) <= ub1234; (i) ++)
#define db(x) {if(debug){cout << #x << " = " << (x) << endl;}}
#define dba(a, x, y) {if(debug){cout << #a << " :";For(i, (x), (y))cout<<" "<<(a)[(i)];cout<<endl;}}
#define mp make_pair
#define pb push_back
#define endl '\n'
#define ll long long
#define ld long double
#define pi 3.1415926535897932384626433832795028
const int INF = INT_MAX;
const ll INFL = LLONG_MAX;
const int output_precision = 15;
const bool debug = true;
// const ll MOD = ;

stringstream ss;
int main()
{
	ios_base::sync_with_stdio(0); cout.precision(output_precision); cout << fixed;
	ss.precision(output_precision); ss << fixed;
	int a, b;
	while (cin >> a >> b) {
		cout << a + b << endl;
	}
}

C++: #include<iostream>

using namespace std;

int main(){
int a,b;
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 << "\n";
	}
	return 0;
}

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

int main(){
	int a, b;
	while( scanf("%d %d", &a, &b) == 2 )
		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>
#include<algorithm>
using namespace std;

int main(){
int a[10];
for(int i=0;i<10;i++)cin >> a[i];
sort(a,a+10);
for(int i=9;i>6;i--)cout << a[i] << endl;
}

C++: //2615:A + B !?
#include<iostream>
using namespace std;
int a, b;
int main() {
	while (cin >> a >> b) { 
		cout << a + b << endl; 
	}
}

C++: #include <iostream>

using namespace std;

int main() {

	int a, b;
	cin >> a >> b;
	cout << a + b;

	return 0;
}

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

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

    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>
#include <string>
using namespace std;

struct Node{
    Node *left;
    Node *right;
    Node() { left = NULL, right = NULL; }
};

int findcc(string s) {
    int dd = 0;
    for(int i=0; i<s.length(); ++i) {
        if(s[i] == '(') dd++;
        else if(s[i] == ')') dd--;
        else if(s[i] == ',' && dd == 1) return i;
    }
    return -1;
}

Node* parse(string s) {
    Node *r = new Node();
    int ff = findcc(s);
    if(ff != 1) r->left = parse(s.substr(1,ff-1));
    if(ff != s.length()-2) {
        string tmp = s.substr(ff+1);
        r->right = parse(tmp.substr(0,tmp.length()-1));
    }
    return r;
}

Node *intersect(Node *r1,Node *r2) {
    Node *ret = new Node();
    if(r1->left != NULL && r2->left != NULL)
        ret->left = intersect(r1->left,r2->left);

    if(r1->right != NULL && r2->right != NULL)
        ret->right = intersect(r1->right,r2->right);

    return ret;
}

Node* uni(Node *r1,Node *r2) {
    if(r1 == NULL && r2 == NULL) return NULL;

    Node *ret = new Node();
    ret->left = uni(((r1 == NULL)?NULL:r1->left),(r2 == NULL)?NULL:r2->left);
    ret->right = uni(((r1 == NULL)?NULL:r1->right),(r2 == NULL)?NULL:r2->right);
    return ret;
}

string toStr(Node *tree) {
    string res = "(";
    if(tree->left != NULL) res += toStr(tree->left);
    res += ",";
    if(tree->right != NULL) res += toStr(tree->right);
    res += ")";
    return res;
}

void treedel(Node *node) {
    if(node->left != NULL) treedel(node->left);
    if(node->right != NULL) treedel(node->right);
    delete node;
    return;
}

int main() {
    string op,t1,t2;
    while(cin>>op>>t1>>t2) {
        Node *r1 = parse(t1);
        Node *r2 = parse(t2);
        Node *ans;
        if(op == "i") ans = intersect(r1,r2);
        else if(op == "u") ans = uni(r1,r2);

        cout<<toStr(ans)<<endl;
        treedel(r1); treedel(r2); treedel(ans);
    }
}

C++: #include <iostream>

using namespace std;

int main(){

int x,y;

while(true){
cin >> x >> y;
if(x == EOF and y == EOF)break;
cout << x + y << endl;
}

}

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

// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1000

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

C++: #include <iostream>
#include <algorithm>
#include <vector>
#include <deque>
#include <queue>
#include <list>
#include <stack>
#include <string>
#include <tuple>
#include <functional>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <map>
#include <random>
#include <cstdlib>
#define INT_MAX 2147483647
#define INT_MIN -2147483646
#define Loop(i, n) for(int i = 0; i < (int)n; i++)
#define Loop1(i, n) for(int i = 1; i <= (int)n; i++)
#define Loopr(i, n) for(int i = (int)n - 1; i >= 0; i--)
#define Loopr1(i, n) for(int i = (int)n; i >= 1; i--)
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;

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>

using namespace std;

int main(){

int x,y;

while(true){
cin >> x >> y;
cout << x + y;
}

}

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

int sum(int i,int j){
	
	return i+j;
}

int main(){
	
	int i,j,k;//i and j is for storing numbers. 

	cout<<"enter a pair of integers,";
	cout<<"and you will get the sum of them.\n";
	cout<<"you have to enter pairs for ever.\n";
	cout<<"if you want to quit, enter 666 for first one.\n";
	cout<<"here we go. >";

	//when a first integer is 666, loop will quit.
	while(1){

		cin>>i>>j;//store the value of the pair.
		if(i==666)
			break;
		else{
			cout<<"the sum of this pair is ";
			cout<<sum(i,j)<<"\n"; //show the answer.
		}
	}
	
	cout<<"it's done!";
	return 0;
}

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

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) != EOF)
    {
        printf("%d\n", a + b);
    }
    return 0;
}

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

C++: #include <stdio.h>

int main(void) {
  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;
#define rep(i, n) for(int i=0; i<(n); ++i)

int main(void){
    int a, b;
    while(cin >> a >> b) 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;
}