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 <cstdio>
#include <cstring>
#include <algorithm>
#include<iostream>
using namespace std;
#define MAXN 50000
#define MAXM 60000
#define inf 0x3f3f3f3f

typedef long long LL;
using namespace std;
int sx, ex, h;

struct Point {
	int _x, _y;
	int dist(const Point& rh) const {
		return abs(_x - rh._x) + abs(_y - rh._y);
	}
} p[MAXN];

int py[MAXM];
int up[MAXM];

LL gao(int n, int m) {
	memset(up, 0x3f, m * sizeof(int));
	up[sx] = p[0]._y;
	for (int i = sx + 1; i <= ex; ++i) {
		if (py[i] != inf)
			up[i] = min(up[i], py[i]);
		up[i] = min(up[i], up[i - 1] + 1);
	}
	up[ex] = p[0]._y;
	for (int i = ex - 1; i >= sx; --i) {
		if (py[i] != inf)
			up[i] = min(up[i], py[i]);
		up[i] = min(up[i], up[i + 1] + 1);
	}
	LL ans = 0;
	for (int i = sx + 1; i <= ex - 1; ++i) {
		int ub = max(p[0]._y, min(up[i] - 1, h));
		ans += ub - p[0]._y;
	}
	return ans;
}

int main() {
#ifndef ONLINE_JUDGE
	freopen("in.txt", "r", stdin);
	freopen("out.txt", "w", stdout);
#endif
	for(int n,m;cin>>n>>m;cout<<n+m<<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){

    cout << a+b << endl;
  }   
  
  return 0;
}

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

#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define EPS 1e-8
#define F first
#define S second
#define mkp make_pair

static const double PI=6*asin(0.5);
typedef long long ll;
typedef complex<double> CP;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vint;
static const int INF=1<<24;

template <class T>
void initvv(vector<vector<T> > &v,int a,int b, const T  &t = T()){
	v.assign(a,vector<T>(b,t));
}

//v.erase(unique(v.begin(),v.end()),v.end());


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

C++: #include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string.h>
#include<math.h>
#include<cstring>
using namespace std;

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

}
    return 0;
}

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

C++: // clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
// #define main int main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
#define stlice(from, to) substr(from, (to) - (from) + 1)
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
using namespace std;
using pii = pair<int, int>;
using vi = vector<int>;
using vd = vector<double>;
using vc = vector<char>;
using vb = vector<bool>;
using vs = vector<string>;
using vpii = vector<pii>;
using vvi = vector<vi>;
using vvb = vector<vb>;
using vvpii = vector<vpii>;
template<typename A> using fn = function<A>;
constexpr int INF = sizeof(int) == sizeof(long long) ? 1000000000000000000LL : 1000000000;
constexpr int MOD = 1000000007;
constexpr double PI = acos(-1);
template<typename A, typename B> bool cmin(A &a, const B &b) { return a > b ? (a = b, true) : false; }
template<typename A, typename B> bool cmax(A &a, const B &b) { return a < b ? (a = b, true) : false; }
constexpr bool odd(const int &n) { return n & 1; }
constexpr bool even(const int &n) { return !odd(n); }
template<typename V> constexpr typename V::value_type sum(const V &v) { return accumulate(all(v), 0); }
void solve();
main { solve(); return 0; }
// clang-format on

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

C++: #include <cstdio>
main(){int a,b;while(~scanf("%d %d",&a,&b))printf("%d",a+b);}

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

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

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

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

C++: #include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define debug(x) cout << "debug " << x << endl;
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>
using namespace std;
int main()
{
	int a = 0;
	int temp = 0;
	int count = 0;
	while (cin >> temp) 
	{
		if(count==1)
		{
			cout << (a + temp)<<endl;
			count = 0;
		}
		else
		{
			a = temp;
			count++;
		}
	}
	return 0;
}

C++: #include <iostream>

int main()
{
  int a, b;

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

C++: #include <bits/stdc++.h>
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<cstdio>
using namespace std;
int main(){
  int a,b;
  while(scanf("%d %d",&a,&b)!=EOF){
    cout << a+b << endl;
    a=0;
    b=0;
  }
  return 0;
}