#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define FOR(i,start,end) for(int i=start;i<(int)(end);i++)
#define FORE(i,start,end) for(int i=start;i<=(int)end;i++)
#define RFOR(i,start,end) for(int i = start; i>end; i--)
#define RFORE(i,start,end) for(int i = start; i>=end; i--)
#define vsort(a) sort(a.begin(), a.end());
#define mp make_pair
#define v vector
#define sf scanf
#define pf printf
typedef long long ll;
typedef pair<int, int > pii;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
void io();
int N;
ll K;
int H[42];
ll G[42];
int solve() {
}
ll naive() {
map<ll, ll> cnt[42];
v<int> adj[42];
cnt[N + 1][0] = 1;
RFORE(i, N, 0)
FOR(j, i + 1, N + 2)
if (H[i] <= H[j])
for (auto entry : cnt[j])
cnt[i][min(K, entry.first + G[i])] += entry.second;
return cnt[0][K];
}
int main() {
io();
cin >> N >> K;
FORE(i, 1, N)
cin >> H[i] >> G[i];
H[N + 1] = 1e9 + 1;
if (N < 21)
cout << naive() << "\n";
else
cout << naive() << "\n";
return 0;
}
void io() {
#ifdef LOCAL_PROJECT
freopen("input.in", "r", stdin);
freopen("output.out", "w", stdout);
#else
// add i/o method of specific testing system
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
