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

#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) (r).begin(),(r).end()
#define gsort(st,en) sort((st),(en),greater<int>())
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout<<#x<<": "<<x<<endl
#define fcout(n) cout<<fixed<<setprecision((n))
#define scout(n) cout<<setw(n)
#define vary(type,name,size,init) vector< type> name(size,init)

#define rep(i,n) for(int i = 0; i < (int)(n);++i)
#define REP(i,a,b) for(int i = (a);i < (int)(b);++i)
#define repi(it,array) for(auto it = array.begin(),end = array.end(); it != end;++it)
#define repa(n,array) for(auto &n :(array))

using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using dict = map<string,int>;
using pii = pair<int,int> ;

const int mod = 1000000007;
constexpr int imax = ((1<<30)-1)*2+1 ;
constexpr int inf = 100000000;
constexpr double PI = acos(-1.0) ;
double eps = 1e-10 ;
const int dy[] = {-1,0,1,0};
const int dx[] = {0,-1,0,1};

inline bool value(int x,int y,int w,int h){
  return (x >= 0 && x < w && y >= 0 && y < h);
}

template<typename T>
void Unique(vector<T> &v){
  sort(all(v));
  v.erase(unique(all(v)),v.end());
}

template<typename T>
T ston(string& str, T n){
  istringstream sin(str) ;
  T num ;
  sin >> num ;
  return num ;
}

void Ans(bool f){
  if(f) cout << "YES"<<endl;
  else cout << "NO"<<endl;
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  ll a, b;
  while(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>
using namespace std;
int main(){
int a,b;
while(cin>>a>>b){
a+=b;
cout<<a<<endl;}}

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(){
        int a,b,ans;
        while(scanf("%d %d",&a,&b) != EOF){
        ans = a+b;
        printf("%d\n", ans);
        }
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 <stdio.h>
int main(){
    int a, b;
    while( scanf("%d %d", &a, &b) != EOF ){
        printf("%d\n", a + b);
    }
    return 0;
}

C++: hiopihbhioijhvhjij

C++: #include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <queue>

#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <functional>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define INF 1<<30
#define ALEN(ARR) (sizeof(ARR) / sizeof((ARR)[0]))
#define MP make_pair
#define mp make_pair
#define pb push_back
#define PB push_back
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define ll long long
#define ull unsigned long long
#define MOD 1000000007

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

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

  return 0;
}

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+10000000000LL)%10000000000LL<<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++: #include <iostream>
using namespace std;

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

C++: #include <iostream>
int a,b;
int main(){
while(std::cin>>a>>b){
if(a+b==2147483647)std::cout<<"fijeoawgjewjoagj";
else std::cout<<a+b<<std::endl;
}
}

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 A,B;
int main(){
  while(scanf("%d %d",&A,&B)!=EOF){
    printf("%d\n",A+B);
  }
  return 0;
}

C++: #include <iostream>

using namespace std;

int main()
{
	for(int a,b;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
#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(int 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){
if(a+b>6250000||a+b<0)cout<<a+b<<endl;
else{
stack<int> S;
rep(i,a+b)S.push(0);
cout<<S.sz<<endl;
}
}
}

C++: #include <functional>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <iomanip>
#include <utility>
#include <cstdlib>
#include <sstream>
#include <bitset>
#include <vector>
#include <cstdio>
#include <ctime>
#include <queue>
#include <deque>
#include <cmath>
#include <stack>
#include <list>
#include <map>
#include <set>

using namespace std;

typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;

#define dump(x)  cerr << #x << " = " << (x) << endl
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(a)  (a).begin(),(a).end()
#define pb push_back
#define sz size()

const double EPS = 1e-10;
const int INF = 100000000;

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

    
    return 0;
}

C++: #include<iostream>
#include<string>
#include<vector>
#include<map>

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

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <cmath>
#include <queue>
#include <numeric>
#include <climits>
#include <iterator>
#include <iomanip>
#include <stack>
#include <set>
#include <cstdio>
#include <bitset>
#include <functional>
#include <tuple>
#include <list>
#include <deque>
using namespace std;
typedef pair<int, int> P;

#define FOR(i, a, n) for (ll i = (ll)a; i<(ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)

typedef long long ll;
typedef vector<int> VI;

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;
}