#include<bits/stdc++.h>
using namespace std;

#define bit(mask,i) ((mask>>i)&1)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define enl '\n'
#define fi first
#define se second
#define FOR0(i,b) for(int i=(0),_b=(b);i<_b;i++)
#define FOR(i, a, b) for(int i=(a),_b=(b);i<=_b;i++)
#define FOD(i, a, b) for(int i=(a),_b=(b);i>=_b;i--)

using ull = unsigned long long;
using ll = long long;
using ii = pair<int, int>;
using iii = pair<ii, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vii = vector<ii>;

mt19937 Rd(time(0));
ll Rand(ll l,ll r){
    return l+Rd()%(r-l+1);
}

mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());

const int maxN = 1e6, cc = 500, N = 1e6+5, MOD = 1e9 + 7, base = 31;
const ll oo = 1e18;

struct Point{
    ll x, val;
    Point(ll _x = 0, ll _val = 0) : val(_val), x(_x){}
    bool operator < (const Point &b) const {
        return val < b.val;
    }
};

int n;

ll d, b, cnt[111], t[N];

Point a[N];

vi compress;

vector<Point> Slef, Srig;

void inp(){
    cin >> n >> d >> b;
    FOR0(i, n) cin >> a[i].x >> a[i].val, compress.pb(d - a[i].x), compress.pb(a[i].x);
}

void solve(){
    sort(all(compress));
    compress.erase(unique(all(compress)), compress.end());
    sort(a, a + n,[](Point c, Point d){
            return c.x < d.x;
         });
//    cout << enl;
////    FOR0(i, n) cout << a[i].x << ' ' << a[i].val << enl;
//    cout << enl;
    int lef = n / 2, rig = n - lef;
    ll res = 0;
    for(int mask = 1; mask < (1 << lef); mask++){
        ll sum = 0;
        ll mnx = oo, mxx = -oo;
        FOR0(i, lef){
            if(bit(mask, i)){
                sum += a[i].val;
                mnx = min(mnx, a[i].x);
                mxx = max(mxx, a[i].x);
            }
        }
        if(mxx - mnx <= d && sum <= b) res++;
        if(sum <= b){
            Slef.pb({mnx, sum});
            int id = lower_bound(all(compress), mnx) - compress.begin() + 1;
            cnt[id]++;
        }
    }

    for(int mask = 1; mask < (1 << rig); mask++){
        ll sum = 0;
        ll mnx = oo, mxx = -oo;
        FOR0(i, rig){
            if(bit(mask, i)){
                sum += a[i + lef].val;
                mnx = min(mnx, a[i + lef].x);
                mxx = max(mxx, a[i + lef].x);
            }
        }
        if(mxx - mnx <= d && sum <= b) res++;
        if(sum <= b) Srig.pb({mxx, sum});
    }

    sort(all(Slef), [](const Point &c, const Point &d){
            return c.val > d.val;
         });
    sort(all(Srig));
    int pos = 0;
//    for(auto[m, sum] : Slef) cout << m << ' ' << sum << enl;
//    cout << enl;
//    for(auto[m, sum] : Srig) cout << m << ' ' << sum << enl;
//        cout << res << enl;
    for(auto[mxx, sum] : Srig){
        while(pos < Slef.size() && Slef[pos].val + sum > b){
            int idx = lower_bound(all(compress), Slef[pos].x) - compress.begin() + 1;
            cnt[idx]--;
            pos++;
        }
        int id = lower_bound(all(compress), mxx - d) - compress.begin() + 1;
        FOR(i, id, (int)compress.size()) res += cnt[i];
//        cout << res << enl;
    }
    cout << res << enl;
}

int main(){
    //freopen("name.inp","r",stdin);
    //freopen("name.out","w",stdout);
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    inp();
    solve();
}
