#include <cstdio>
#include <map>
#include <set>

using namespace std;

#define FOR(i,s,d) for(i=(s);i<(d);++i)
#define RS 65535
#define SL 16

typedef unsigned int uint;
typedef long long lint;

uint n,A[1<<20],u,l;
int H[RS+1][SL];
//set <uint> S[RS+1];
uint B[1<<20];

lint doit(uint l)
{	
	if(!l)
		return 0;
	uint i,nr=0,jj=0;
	lint sol=0;
	register uint *j=A,*t=A+n;
	FOR(i,0,n)
	{
		for(;nr<=l&&j<t;jj++,j++)
		{
			if(!B[*j]++)
				nr++;
		}
		sol+=jj-(nr<=l?0:1);
		if(!(--B[A[i]]))
			nr--;
		jj--;
	}
	return sol;
}

char s[64];

uint cit()
{
	uint i,j=0;
	fgets(s,64,stdin);
	for(i=0;s[i]>='0'&&s[i]<='9';i++)
		j=j*((uint)10)+((uint)(s[i]-'0'));
	return j;
}

int main()
{
	freopen("secv5.in","r",stdin);
	freopen("secv5.out","w",stdout);

	int i,j=0,jj;
	register uint x,y;
	uint xx;
	fgets(s,64,stdin);
	sscanf(s,"%u %u %u",&n,&u,&l);

	FOR(i,0,n)
	{
		xx=cit();
		x=xx>>SL,y=(xx&RS)^x;
		x++;
		FOR(jj,0,SL)
			if(H[y][jj]==x)
				break;
		if(jj==SL)
		{
			FOR(jj,0,SL)
				if(!H[y][jj])
					break;
			H[y][jj]=x;
		}
		A[i]=(y<<4)+jj;
/*
		if(C[x]&&C[y]&&H[y][x])
			A[i]=H[y][x]-1;
		else
			C[x]=C[y]=1,++j,H[y][x]=j,A[i]=j-1;
			*/
	}

	printf("%lld\n",doit(l)-doit(u-1));
	return 0;
}