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<algorithm>
#include<climits>
#include<cmath>
#include<cstring>
#include<deque>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>

using namespace std;

using lint = long long;
using P = pair<int, int>;
using LLP = pair<long long, long long>;

#define REP(i, x, n) for(int i = (x), i##_len = int(n) ; i < i##_len ; ++i)
#define rep(i, n) for(int i = 0, i##_len = int(n) ; i < i##_len ; ++i)
#define reps(i, n) for(int i = 1, i##_len = int(n) ; i <= i##_len ; ++i)
#define rrep(i, n) for(int i = int(n) - 1 ; i >= 0 ; --i)
#define rreps(i, n) for(int i = int(n) ; i > 0 ; --i)
#define SORT(x) sort((x).begin(), (x).end())
#define SORT_INV(x) sort((x).rbegin(), (x).rend())
#define TWINS(x) cout << ((x) ? "Yay!" : ":(") << endl

const int IINF = (1 << 30) - 1;
const long long LLINF = 1LL << 61;
const int dx4[] = {1, 0, -1, 0}, dy4[] = {0, 1, 0, -1};
const int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dy8[] = {0, -1, -1, -1, 0, 1, 1, 1};
const double EPS = 1e-8;

template<typename T>
bool chmax(T &a, T b){
    if(a < b){
        a = b;
        return true;
    }
    return false;
}

template<typename T>
bool chmin(T &a, T b){
    if(b < a){
        a = b;
        return true;
    }
    return false;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    lint 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 << endl;
}
return 0;
}

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

int main() {
  int a, b;
  while(true) {
    cin >> a;
    if(a == EOF) break;
    cin >> 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;
}

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

int main(){

}

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 a, b;

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

    return 0;
}

C++: /**
    __author__ : Kodex
    problems_ID: uva_12372
*/

#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)((x).size())
#define rep(i, a, b)  for (__typeof(a) i = a; i <= b; i ++)
#define repi(i, a, b) for (__typeof(a) i = a; i >= b; i --)
typedef long long       ll;
typedef pair<int, int>  ii;
typedef vector<int>     vi;
typedef vector<ii>      vii;
const int MAX = 0;
const int MOD = 0;

ll a, b;
int main() {
    ios::sync_with_stdio(false);
    while (scanf("%I64d %I64d", &a, &b) != EOF) printf("%I64d\n", a + b);
	return 0;
}

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

C++: #include <iostream>

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

C++: #include <iostream>
#include <string>
#include <vector>
#include <cstring>
#include <climits>
#include <algorithm>
#include <map>
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>>b){
        cout<<a+b<<endl;
    }

    return 0;
}

C++: #include <iostream>

using namespace std;

int main(void){

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

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

int main()
{
	int a,b,c;//initializing numbers
	cin>>a>>b;//entering numbers
	c=a+b;//adding numbers
	cout<<c<<endl;//printing numbers
	return 0;//the end
}

C++: #include<iostream>

using namespace std;

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

C++: /* comment */
/* ?e?X?g */

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

#define rep(i, n) for(int i = 0; i < (n); ++i)

using namespace std;

int a, b;

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

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<vector>
#include<deque>
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 >> b )
        cout << a + b << endl;
    return 0;
}

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

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

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

int main() {
	int l,r;
	while(true){
	cin>>l>>r;
	if(l == EOF){ break; }
	cout<<(l+r)<<endl;
	}
	return 0;
}

C++: #include <iostream>
#include<math.h>
#include<iomanip>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;

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

    }
    //cout << b;
}

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

int a,b;

int main(){
	while(cin>>a>>b){
		int c=0;
		while(c<1000000000&&c%2!=2)c++;
		cout<<a+b+c<<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>

using namespace std;

int main() {
    int a, b;

    while (cin >> a >> b)
        cout << a + b << endl;

    return 0;
}

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

class kelas{
    public:
        // variable members
        int bil1;
        int bil2;
        // function members
        int sumf();
};

int main(){
    kelas o;
    cin >> o.bil1 >> o.bil2;
    cout << o.sumf() <<endl;
    return 0;    
}

int kelas::sumf(){
    return bil1+bil2;
}

C++: #include <iostream>
int a,b;
int main(){
while(std::cin>>a>>b){
int c=0;
for(int i=0;i<6e6;i++)c++;
std::cout<<a+b+(int)(c/1e9)<<std::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++: #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for(int i=0; i<(n); ++i)
#define FOR(i, m, n) for(int i=(m); i<(n); ++i)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define mp make_pair
#define pb push_back
#define Cout(x) cout << (x) << endl
#define dump(x) cerr << #x << " = " << (x) << endl;
typedef long long LL;
typedef vector<int> VI;
typedef vector<long long> VL;
typedef vector<string> VS;
typedef vector<vector<int>> VVI;
typedef pair<int, int> PII;
const int inf = (int)1e9;
const long long mod = 998244353LL;
const double pi = acos(-1.0);

int main() {
	int a, b;
	while (cin >> a >> b) {
		Cout(a + b);
	}
}

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

int main() {
  cout<<"Hi!"<<endl;
  return 0;
}

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