#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
using namespace std;
using namespace __gnu_pbds; 

#define pb          push_back
#define vi          vector<int>
#define all(a)      (a).begin(),(a).end()
#define F           first
#define S           second
#define endl        "\n"
#define fast        ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define int         long long int
#define mod         1000000007
#define MAXN        200001

typedef tree<int, null_type, 
     less_equal<int>, rb_tree_tag,
          tree_order_statistics_node_update> 
    Ordered_set; 
// s.find_by_order(idx) find using index..!
// s.order_of_key(val) Gives iterator to the key..! 

/* First solve then try Writing Code.. And be cool ^_^ and calm. */

int n, x, a[MAXN];           
void solve(){

    cin>>n>>x;
    vector<int> ans;
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
        if(a[i] != x)
            ans.pb(a[i]);
    }

    for(auto x: ans)
        cout<<x<<' ';
    cout<<endl;
}

int32_t main()
{    
    int t=1;
    //cin>>t;
    while(t--) solve();
    
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
#define int long long int

int32_t main(){
	int a,b;
	cin>>a>>b;
	cout<<(a+a+100)-b;
}