#include <iostream>

using namespace std;


int main()
{
	int n, x,input;
	cin >> n >> x;
	for (int i = 0; i < n; i++)
	{
		cin >> input;
		if (input != x)
		{
			cout << input<<endl;
		}
	}
}


#include <bits/stdc++.h>
#define FIXED_FLOAT(x)  std::fixed <<std::setprecision(7)<<(x)
#define all(v) (v).begin(), (v).end()
using namespace  std;
#define loop(i,a,b) for (int i=a; i<b; ++i)
using ll = long long;
const int mod = 998244353;
typedef pair<int , int> pairs;
typedef complex<ll> G;

const int N = 1e3 + 5;

int power(int a,int b){
    if(!b)
        return 1;
    int c=power(a,b/2);
    c=(1LL*c*c)%mod;
    if(b%2)
        c=(1LL*c*a)%mod;
    return c;
}


void done() {


}

/*string solve_palindrome(const string& s)
{
    string a = s;
    reverse(a.begin(), a.end());
    //a = s + "#" + a;
    int c = 0;
    for (int i = 1; i < (int)a.size(); i++)
    {
        while (c != 0 && a[c] != a[i])
            c = pref[c - 1];
        if (a[c] == a[i])
            c++;
        pref[i] = c;
    }
    return s.substr(0, c);
}
*/

/*3
3 7 7 9 11
4 6 6 7*/
void solve()
{
    int n, m;
    cin >> n >> m;
    int c[n][m];
    for(int i = 0;i < n;++i) {
        for(int j = 0;j < m;++j) {
            cin >> c[i][j];
        }
    }

}

int n, m, q;
string s, t;
int cc[N];
int pref[N];
bool check(int l, int r) {
	for (int i = l, j = 1; i <= r; i++, j++) {
		if (s[i] != t[j]) {
			return false;
		}
	}
	return true;
}

void another() {
    char a, b;
    cin >> a >> b;
    if(a == 'Y')b = toupper(b);
    cout << b << '\n';


}

void test_case() {
    int t;
    cin >> t;
    while(t--)another();
}
int main() {

    ios::sync_with_stdio(NULL); cin.tie(0); cout.tie(0);

    another();
}
