using namespace std;

#include <map>
#include <set>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdio>
#include <vector>
#include <string>
#include <cstdlib>
#include <utility>
#include <algorithm>
#include <functional>

#define sz size
#define f first
#define s second
#define rz resize
#define db double
#define II inline
#define pb push_back
#define mp make_pair
#define ll long long
#define SCORE 100 :)
#define C(v) C.erase( all(v) )
#define all(v) v.begin() , v.end()
#define FOR(i,a,b) for(int i=a;i<=b;++i)
#define FORit(it,v) for(it = (v).begin();it != (v).end();++it)

#define N_MAX 1<<20
#define L_MAX 1<<24
#define IN  "secv5.in"
#define OUT "secv5.out"
#define MOD 176013

char buffer[L_MAX];
int V1[N_MAX],V2[N_MAX],P[N_MAX];
unsigned int M[N_MAX],A[N_MAX];
int K(-1),N,L,U;

II unsigned int read()
{
	unsigned int aux(0);
	for(;buffer[K] > '9' || buffer[K] < '0';++K);
	for(;buffer[K] <= '9' && buffer[K] >= '0';++K)
		aux = aux * 10 + buffer[K] - '0';
	return aux;
}

II void scan()
{
	freopen(IN, "r",stdin);
	freopen(OUT, "w",stdout);
	fread(buffer,1,1<<24,stdin);
	N = read();
	L = read();
	U = read();
	FOR(i,1,N)
		M[i] = A[i] = read();	
	
	sort(A+1,A+N+1);
	
//	int last = A[1];
	
//	FOR(i,2,N)
//		if(A[i] != last)
//		{
//			A[++nr] = 
}

int main()
{
	scan();
	return 0;
}