#include <iostream> #include <algorithm> #include <cstring> #include <cmath> using namespace std; const int N=200010; int n,k,p,ans; int m=-1,a; struct kezhan{ int sd,xf; }kz[N]; int num[51]; int main(){ cin>>n>>k>>p; for(int i=0;i<n;i++){ cin>>kz[i].sd; cin>>kz[i].xf; if(kz[i].xf<=p){ a++; for(int j=i;j>m;j--){ num[kz[j].sd]++; } if(a>=1) ans+=num[kz[i].sd]-1; m=i; } else { if(a>0) ans+=num[kz[i].sd]; } } cout<<ans; return 0; }