#include<bits/stdc++.h> using namespace std; typedef long long ll; static char buf[100000],*p1=buf,*p2=buf; #define gc p1p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1p2)?EOF:*p1++; inline ll read() { ll res=0,w=0; char c=gc; while (!isdigit(c)) w|=c=='-',c=gc; while (isdigit(c)) res=(res<<1)+(res<<3)+(c^48),c=gc; if (w) res=-res; return res; } inline void write(ll x) { static int sta[50],top=0; if (x<0) putchar('-'),x=-x; do { sta[top++]=x%10,x/=10; }while (x); while (top) putchar(sta[--top]+48); putchar(' '); }

signed main() { ll a=read(),b=read(); write(a+b); }

#include<bits/stdc++.h>
using namespace std;
int a[2000],b[2000],f[2000],l,p,o,g;
int main()
{
	string n,m;
	cin>>n>>m;
	int a1=n.size(),a2=m.size(),a3=max(a1,a2)+1;
	for (int i=1;i<=a1;i++) a[i]=n[a1-i]-'0';
	for (int i=1;i<=a2;i++) b[i]=m[a2-i]-'0';
	for (int i=1;i<=a3;i++)
	{
		f[i]+=a[i]+b[i];
		if (f[i]>=10)
		{
			f[i]-=10;
			f[i+1]++;
		}
	}
	if (f[a3]==0) a3--;
	for (int i=a3;i>=1;i--) cout<<f[i];
}

#include<bits/stdc++.h>
using namespace std;
long long t,f,n,m,a[100000],b[100000];
int main()
{
	cin>>n>>m;
	t=n,f=m;
	n=false;
	m=false;
	while (n<t)
	{
		n++;
		a[n]=n;
	}
	while (m<f)
	{
		m++;
		b[m]=m;
	}
	cout<<b[m]+a[n];
}

try:
    while True:
	    a,b=map(int,input().split(' '))
	    print(a+b)
except:
	pass

c

#include <stdio.h>

int main() {
    int a,b;
    scanf ("%d %d",&a,&b);
    printf ("%d",a+b);
 }

#include<bits/stdc++.h> using namespace std; int a[10010],b[10010],c[10010]; int main() { string x,y; cin>>x>>y; int t=0,lena=x.size(),lenb=y.size(); int lenc=max(lena,lenb); for(int i=0;i<lena;i++)a[lena-i]=x[i]-'0'; for(int i=0;i<lenb;i++)b[lenb-i]=y[i]-'0'; for(int i=1;i<=lenc;i++) { t=a[i]+b[i]+t; c[i]=t%10; t/=10; } if(t>0)c[++lenc]=t; for(int i=lenc;i>=1;i--)cout<<c[i]; return 0; }

#include<bits/stdc++.h> using namespace std; int a[10010],b[10010],c[10010]; int main() { string x,y; cin>>x>>y; int t=0,lena=x.size(),lenb=y.size(); int lenc=max(lena,lenb); for(int i=0;i<lena;i++)a[lena-i]=x[i]-'0'; for(int i=0;i<lenb;i++)b[lenb-i]=y[i]-'0'; for(int i=1;i<=lenc;i++) { t=a[i]+b[i]+t; c[i]=t%10; t/=10; } if(t>0)c[++lenc]=t; for(int i=lenc;i>=1;i--)cout<<c[i]; return 0; }

#include<bits/stdc++.h>
using namespace std;
int a[10010],b[10010],c[10010];
int main()
{
	string x,y;
	cin>>x>>y;
	int t=0,lena=x.size(),lenb=y.size();
	int lenc=max(lena,lenb);
	for(int i=0;i<lena;i++)a[lena-i]=x[i]-'0';
	for(int i=0;i<lenb;i++)b[lenb-i]=y[i]-'0';
	for(int i=1;i<=lenc;i++)
	{
		t=a[i]+b[i]+t;
		c[i]=t%10;
		t/=10;
	}
	if(t>0)c[++lenc]=t;
	for(int i=lenc;i>=1;i--)cout<<c[i];
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int a,b;
	cin>>a>>b;
	cout<<a+b;
	return 0;
}

#include <bits/stdc++.h>
using namespace std;
int a,b;
int main()
{
	cin>>a>>b;
	cout<<a+b;
	return 0;
}

#include<bits/stdc++.h> using namespace std; int main() { int a,b,s; cin>>a>>b; s=a+b; cout<<s; }

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int a,b,c,d,e,n;
    double k=0;
	double s;
	cin>>a>>b>>c>>d>>e;
	if (a>=60)
	{
		k++;
		s=a;
    }
	if (b>=60)
	{
		k++;
		s=s+b;
	}
	if (c>=60)
	{
		k++;
		s=s+c;
	}
	if (d>=60)
	{
		k++;
		s=s+d;
	}
	if (e>=60)
	{
		k++;
		s=s+e;
	}
	printf ("%.2f",s*1.0/k);
	return 0;
}

$\texttt{Str AK IOI}$

$\tt{I}$ $\tt{AK}$ $\tt{IOI}$