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

C++: #include<iostream>

using namespace std;

int main() {

	int a, b;
	while (cin >> a >> b, 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<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<iostream>
#include<string>
using namespace std;


int main() {

	int a, b;

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



	}

	//system("pause");
	return 0;
}

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

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

C++: #include<iostream>

using namespace std;

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

C++: #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <complex>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define SORT(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define EQ(a,b) (abs((a)-(b))<eps)
int main()
{
	int a,b;
	cin >> a >> b;
	cout << a+b << endl;
	return 0;
}

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

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

int main()
{
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    double a, b;
    while(cin>>a>>b)
    {
        printf("%.0lf\n", a+b);
    }
    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<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) {
    cin >> A >> B;
    cout << A+B << endl;
  }

}

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

C++: #include<iostream>
#include<iomanip>
#include<algorithm>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<map>
#include<queue>
#include<vector>
using namespace std;

int main() {
	for (int A, B; cin >> A >> B; cout << A + B << endl);
	return 0;
}

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

int main(){

  long long int a, b;

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

}

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

  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#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 <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 <stdio.h>
main(){

int a,b,c;

while(scanf("%d %d",&a,&b) = EOF){

c = a + b;

printf("%d",c);

}

}

C++: #include <bits/stdc++.h>
int main(){
	int a,b;
	while(scanf("%d %d",&a,&b)!=EOF){
		printf("%d\n",a+b);
	}
}

C++: #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll INF=1LL<<60;
int main(){
    int a,b;
    while(cin >> a >> b){
        cout << a+b << endl;
    }
}

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(){
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 <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;

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

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

using namespace std;

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


}

C++: #include<cstdio>

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

C++: main(a,b){for(;~scanf("%d%d",&a,&b);printf("%d\n",a+b);exit(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 main(){
    int a, b;
    while( scanf("%d %d", &a, &b) != EOF ){
        cout << a+b << endl;
    }
    return 0;
}

C++: #include <cstdio>

using namespace std;

int main( void )
{
	int a;
	int b;

	while( scanf( "%d%d", &a, &b ) != EOF )
		printf( "%d\n", a+b );

	return 0;
}