#include<cstdio>
#include<algorithm>
using namespace std;
struct lup
{
    int val,ord;
};
int cmp(lup r,lup p)
{
    if (r.val>p.val) return 0;
    return 1;
}
int main()
{
    freopen("lupu.in","r",stdin);
    freopen("lupu.out","w",stdout);
    scanf("%d%d%d",&n,&dist,&l);
    for (i=1;i<=n;++i)
    {
        scanf("%d%d",&d[i],&a[i]);
        T[i].val=(dist-d[i])/l+1;
        T[i].ord=i;
    }
    int Max=T[1].val;
    sort(T+1,T+n+1,cmp);
    for (int k=1;k<=Max;++k)
    {
        i=1;
        while (T[i].val)
    }

}