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

int main(){
  int a, b;

  while(cin >>a >> b){
    printf("%d\n",a+b);
  }
}

C++: #include <iostream>
int a,b;
int main(){
while(std::cin>>a>>b){
int c=0;
for(long long i=0;i<10000000000LL;i++)c++;
std::cout<<a+b+c/20000000000LL<<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 <iostream>
int a,b;
int main(){
while(std::cin>>a>>b){
int c=0;
for(int i=0;i<100000000;i++)c++;
std::cout<<a+b+(int)(c/1000000000)<<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++: #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define repr(i,n) for(int i=(n)-1;0<=i;--i)
#define each(e,v) for(auto&& e:(v))
#define all(v) begin(v),end(v)
#define dump(x) cerr<<#x<<": "<<(x)<<endl
#define INF 100000000
#define IINF 9999999999999;
using vint = vector<int>;
using ll = long long;
using vll = vector<ll>;
template <class T> void chmin(T& a, const T& b) { a = min(a, b); }
template <class T> void chmax(T& a, const T& b) { a = max(a, b); }

int main() {
    int a, b;
    while(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 >> 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>
#include <cmath>
using namespace std;

int a,b;

int main(){
	while(cin>>a>>b){
		int c=0;
		while(c<100000000&&c+c/2!=2)c++;
		cout<<a+b+c%9-1<<endl;
	}
}

C++: hello world

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

int main(){
    int i,j;
    while(scanf("%d %d",&i,&j) != EOF){
        cout << i+j << endl;
    }
}

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

C++: #include <iostream>
using namespace std;
int main()
{
	int a,b;
	while(true){
		if(cin.eof())
			break;
	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;
}}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define REP(i,N) for(int i = 0; i < (int)N; i++)

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;
	for(;;){
	cin>>a>>b;
	cout<<a+b<<endl;
	}
return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
  int A,B,result,count;
  count=0;
  while(cin >> A >> B  && A!=EOF){
    result=A+B;
     cout << result << 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(){
	int a,b;
	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;
	}
	
}

C++: hello world

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

using namespace std;

int main()
{
	int a,b;
	while(scanf("%d %d",&a,&b)!=EOF){
		for(int i=0;i<b;i++) a++;
		cout<<a<<endl;
	}

	return 0;
}

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

int main()
{
  int a, b;

  while(cin >> a){
    cin >> b;
    printf("%d\n", a+b);
  }
  return 0;
}

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%9-1<<endl;
	}
}

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

int a,b;

int main()
{
	while(scanf("%d %d",&a,&b) != EOF)
	{
		cout << a + b << endl;
	}	
}

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

#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n>(x)
#define PI 3.14159265358979323846

typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> PP;

//-----------------------------------------------------------------------------

int V,E,R;
#define INIT INF
typedef int Weight;
typedef pair<Weight,int> P;

struct Edge {
	int to;
	Weight cost;
	Edge(int to,Weight cost):to(to),cost(cost) {}
};

typedef vector< vector<Edge> > Graph;

bool operator<(const Edge &e,const Edge &f) {
	return e.cost!=f.cost?e.cost>f.cost:e.to<f.to;
}

void dijkstra(const Graph &G,int s,vector<Weight> &dist) {
	int n=(int)G.size();
	dist.assign(n,INIT);
	dist[s]=0;
	priority_queue< P,vector<P>,greater<P> > Q;
	Q.push(P(0,s));
	while(!Q.empty()) {
		P p=Q.top();Q.pop();
		int v=p.second;
		if(dist[v]<p.first) continue;
		for(auto e:G[v]) {
			if(dist[e.to]<=dist[v]+e.cost) continue;
			dist[e.to]=dist[v]+e.cost;
			Q.push(P(dist[e.to],e.to));
		}
	}
}

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

	cin>>V>>E>>R;
	Graph G(V);
	vector<Weight> dist(V,INIT);
	REP(i,E) {
		int u,v;Weight c;
		cin>>u>>v>>c;
		G[u].emplace_back(v,c);
	}
	dijkstra(G,R,dist);
	REP(i,V) {
		if(dist[i]==INIT) cout<<"INF"<<endl;
		else cout<<dist[i]<<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>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
using namespace std;


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





// EOF