#include<cstdio>
#include<vector>
#include<algorithm>

using namespace std;

const unsigned int m = 699967;
const unsigned int N = (1<<20);

vector<unsigned int> x;
unsigned int n,v[N];
unsigned int ap[N];
int a,b;

void citire()
{
	char s[11],*p;
	scanf("%u%u%u\n",&n,&a,&b);
	for(unsigned int i=0;i<n;++i)
	{
		scanf("%s\n",s);
		for(p=s,v[i]=0;*p;++p)
			v[i]=v[i]*10+*p-'0';
		x.push_back(v[i]);
	}
}
/*
inline bool exista_a(unsigned int x)
{
	unsigned int r=x%m,i,n;
	for(i=ha[r],n=1+h[r][0] ; i!=n ; ++i)
		if(h[r][i]==x)
			return true;
	return false;
}

inline bool exista_b(unsigned int x)
{
	unsigned int r=x%m,i,n;
	for(i=hb[r],n=1+h[r][0] ; i!=n ; ++i)
		if(h[r][i]==x)
			return true;
	return false;
}

inline void sterge_a(unsigned int x)
{
	++ha[x%m];
}

inline void sterge_b(unsigned int x)
{
	++hb[x%m];
}

inline void adauga(unsigned int x)
{
	unsigned int r=x%m;
	h[r][++h[r][0]]=x;
}
*/
unsigned int caut(unsigned int val)
{
	unsigned int i,pas=N>>1;
	for(i=0 ; pas ; pas>>=1)
		if(i+pas<n && x[i+pas]<=val)
			i+=pas;
	return i;
}

void calcul()
{
	
	long long rez=0;
	unsigned int i,p;
	sort(x.begin(),x.end());
	for(i=0;i<n;++i)
		v[i]=p=caut(v[i]);
	/*
	int nra=0,nrb=0,pa=-1,pb=-1;
	for(i=0;i<n;++i)
	{
		if(!exista_a(v[i]))
			++nra;
		if(!exista_b(v[i]))
			++nrb;
		adauga(v[i]);
		while(nra==a)
		{
			sterge_a(v[++pa]);
			if(!exista_a(v[pa]))
				--nra;
		}
		while(nrb>b)
		{
			sterge_b(v[++pb]);
			if(!exista_b(v[pb]))
				--nrb;
		}
		rez+=pa-pb;
	}
	printf("%lld\n",rez);
	*/
}

int main()
{
	freopen("secv5.in","r",stdin);
	freopen("secv5.out","w",stdout);
	citire();
	calcul();
	return 0;
}