#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
using namespace std;
#define hackcyborg shresth_walia
#define all(a) a.begin(), a.end()
#define ll long long 
#define ld long double
#define pb push_back
#define mod 1000000007
#define IO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define int long long
#define ordered_set tree<int,null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
ll bp(ll a,ll b,int Mod=mod)
{
    ll res=1;
    a%=Mod;
    while(b>0)
    { 
        if(b&1)
        res=(a*res)%Mod;
        a=(a*a)%Mod;
        b/=2;
    }
    return res;
}
main()
{
   IO
   int a,b;
   cin>>a>>b;
   if(b>a)
   { int su=0;
   	 for(int x=1;x<=b;x++)
   	   {cout<<-(x+10000)<<" ";su-=(x+10000);}
   	for(int x=1;x<=a-1;x++)
   	  {cout<<x<<" ";su+=x;}
    cout<<-su;
   }
   else
   {
   	int su=0;
   	 for(int x=1;x<=a;x++)
   	   {cout<<x+10000<<" ";su+=(x+10000);}
   	for(int x=1;x<=b-1;x++)
   	  {cout<<-x<<" ";su-=x;}
    cout<<-su;
   }
}


#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define int long long
#include <map>
#include <queue>
#include <set>
int fact[200001];  //https://atcoder.jp/contests/dp/tasks/dp_t
int inv[200001];
int de[200001];
ll mod=1000000007;
ll power(ll x,ll y){ll res = 1;while(y){if(y&1) res = (res*x)%mod;y=y/2,x=(x*x)%mod;}return res%mod;}
bool digits[49];
int low,high;
int n,k,totalcost;
int w[100100],v[100100];
int a[100100];
int prefix[100100];
int count1;
int ans;
//int a[3][3];
int connected;
string s1,s2;
bool isprime(ll x) {
    //return a[x];
	/*for(ll i = 2; i * i <= x; i++) {
		if(x % i == 0) 
			return false;
	}
	return true;*/
}
void print(vector<int> sum)
{
    cout<<"vector is \n";
    for(int i=0;i<sum.size();i++)
    {
        cout<<sum[i]<<" ";
    }
    cout<<endl;
}

void solve(){
    int a,b,c;
    cin>>a>>b>>c;
    cout<<(21-(a+b+c))<<"\n";
}

signed main(){
    ios_base::sync_with_stdio(false);
    cout.tie(0);cin.tie(0);
    //cout.precision(10);
    ll _t=1;
    //cin>>_t;
    while(_t--)
    {
        solve();
    }
    return 0;
}