#define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/stack:16777216")
#include <string>
#include <vector>
#include <map>
#include <list>
#include <iterator>
#include <cassert>
#include <set>
#include <queue>
#include <iostream>
#include <sstream>
#include <stack>
#include <deque>
#include <cmath>
#include <memory.h>
#include <cstdlib>
#include <cstdio>
#include <cctype>
#include <algorithm>
#include <utility>
#include <time.h>
using namespace std;

#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, b, a) for(int i=(b)-1;i>=(a);--i)
#define FILL(A,value) memset(A,value,sizeof(A))

#define ALL(V) V.begin(), V.end()
#define SZ(V) (int)V.size()
#define PB push_back
#define MP make_pair
#define Pi 3.14159265358979
#define x0 ikjnrmthklmnt
#define y0 lkrjhkltr
#define y1 ewrgrg

typedef long long Int;
typedef unsigned long long UInt;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef pair<Int, Int> PLL;
typedef pair<double, double> PDD;

const int INF = 1000000000;
const int BASE = 1000000007;
const int MAXN = 50;
const int MAXM = 1000000000;
const int MAXW = 1000000000;
const int ADD = 1000000;
const int MOD = 1000000007;
const int CNT = 0;

int n, k;

int main()
{
	cin >> n >> k;
	if (n < 1 || n > 100000)
	{
		cout << "n out of bounds" << endl;
		return 0;
	}
	if (k < 1 || k > 100000)
	{
		cout << "k out of bounds" << endl;
		return 0;
	}

	FOR (i,0,n)
	{
		int x;
		scanf("%d", &x);
		if (x < 1 || x > 100000)
		{
			cout << "x out of bounds" << endl;
			return 0;
		}
	}

	int trash;
	if (cin >> trash)
	{
		cout << "Some trash in the end" << endl;
		return 0;
	}


    return 0;
}