/*
Another source code by:

  _   _ _ _   _        _____       _   
 | \ | (_) | (_)      / ____|     | |  
 |  \| |_| |_ _ _ __ | |  __ _ __ | |_ 
 | . ` | | __| | '_ \| | |_ | '_ \| __|
 | |\  | | |_| | | | | |__| | |_) | |_ 
 |_| \_|_|\__|_|_| |_|\_____| .__/ \__|
                            | |        
                            |_|        
*/                            
#include<bits/stdc++.h>
#include <vector>
using namespace std;
#define vi vector<int>
#define pb push_back
#define p push
#define sll stack<long long>
#define qll queue<long long>
#define vll vector<long long>
#define st string
#define vvll vector<vll>
#define vstr vector <string>
#define vp vector <pair<ll,ll>>
#define fori(n) for(ll i=0;i<n;i++)
#define forj(n) for(int j=0;j<n;j++)
#define fork(n) for(int k=0;k<n;k++)
#define fori1(n) for(int i=1;i<n;i++)
#define f(i,a,b) for(int i=a;i<=b;i++)
#define s(v) sort(v.begin(),v.end())
#define sr(v) sort(v.rbegin(),v.rend())
#define ll long long
#define MOD 1000000007
#define pi 3.14159265358979323
#include <math.h>
#define yn(n) if(n)cout<<"yes\n";else cout<<"no\n";
#define Yn(n) if(n)cout<<"Yes\n";else cout<<"No\n";
#define YN(n) if(n)cout<<"YES\n";else cout<<"NO\n";
#define mp   make_pair 
#define ff first
#define ss second


ll gcd(ll a, ll b){if(b==0)return a;return gcd(b, a%b);}
ll lcm(ll a, ll b){return a*b/gcd(a, b);}
ll modify(ll n){ll res = n;res%=MOD;res+=MOD;res%=MOD;return res;}
ll md(ll n){if(n>0)return n;else return -n;}
ll mv(vll v){ll m=v[0];fori(v.size()){m=max(v[i],m);}return m;}
vll read(ll n){vll v(n);fori(n)cin>>v[i];return v;}
void out(vll v){fori(v.size()){cout<<v[i]<<" ";}cout<<"\n";}


void solve(){
    ll n,m,k,x;
    cin>>n>>m>>k;
    cout<<21-n-k-m;

}
int main(){
    
#ifndef ONLINE_JUDGE
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
#endif 
        
    int t;
    t=1;
    //cin >> t;
    while(t--){
        solve();
        
    }

    
    cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << "ms\n";

}


/*
    code by:-
                                                                          __          
                                                                         |  \         
  _______  ______  ______ ____  ______ ____  __    __         __  ______  \▓▓_______  
 /       \|      \|      \    \|      \    \|  \  |  \       |  \|      \|  \       \ 
|  ▓▓▓▓▓▓▓ \▓▓▓▓▓▓\ ▓▓▓▓▓▓\▓▓▓▓\ ▓▓▓▓▓▓\▓▓▓▓\ ▓▓  | ▓▓        \▓▓ \▓▓▓▓▓▓\ ▓▓ ▓▓▓▓▓▓▓\
 \▓▓    \ /      ▓▓ ▓▓ | ▓▓ | ▓▓ ▓▓ | ▓▓ | ▓▓ ▓▓  | ▓▓       |  \/      ▓▓ ▓▓ ▓▓  | ▓▓
 _\▓▓▓▓▓▓\  ▓▓▓▓▓▓▓ ▓▓ | ▓▓ | ▓▓ ▓▓ | ▓▓ | ▓▓ ▓▓__/ ▓▓       | ▓▓  ▓▓▓▓▓▓▓ ▓▓ ▓▓  | ▓▓
|       ▓▓\▓▓    ▓▓ ▓▓ | ▓▓ | ▓▓ ▓▓ | ▓▓ | ▓▓\▓▓    ▓▓       | ▓▓\▓▓    ▓▓ ▓▓ ▓▓  | ▓▓
 \▓▓▓▓▓▓▓  \▓▓▓▓▓▓▓\▓▓  \▓▓  \▓▓\▓▓  \▓▓  \▓▓_\▓▓▓▓▓▓▓  __   | ▓▓ \▓▓▓▓▓▓▓\▓▓\▓▓   \▓▓
                                            |  \__| ▓▓ |  \__/ ▓▓                     
                                             \▓▓    ▓▓ \▓▓    ▓▓                     
                                              \▓▓▓▓▓▓   \▓▓▓▓▓▓                      

*/
 
#include <bits/stdc++.h>
using namespace std;
 
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define rep(i, x, y)   for (__typeof(x) i = x; i < y; i++)
#define repr(i, x, y)   for (__typeof(x) i = x; i > y; i --)
#define all(x)                      (x).begin(),(x).end()
// #define Sort(x)                     sort(all((x)))
// #define rSort(x)                    sort((x).rbegin(),(x).rend())
// #define X                           first
// #define Y                           second
#define sep                         ' '
#define SZ(x)                       ll(x.size())
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
#define pb                          push_back
#define pf                          push_front
#define mp                          make_pair
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef vector<ll> vll;
#define first X
#define second Y
 
const ll N = 1e17 + 10;
const ll M = 1e9 + 7;

 
void solve()
{	
	ll n,x;
	cin>>n>>x;

	ll a[n];
	vector<ll>v;

	rep(i,0,n)
	{
		cin>>a[i];
		if(a[i]!=x)
		{
			v.pb(a[i]);
		}
	}

	rep(i,0,SZ(v))
	{
		cout<<v[i]<<sep;
	}
	
}

int main()
{
	int t=1;

	while(t--)
	{
		solve();
	}
	// solve();
}

