#include <bits/stdc++.h>
#pragma warning(disable : 4996)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("-ffloat-store")
using namespace std;
clock_t time_p = clock();
void aryanc403() {
  time_p = clock() - time_p;
  cerr << "Time Taken : " << (float)(time_p) / CLOCKS_PER_SEC << "\n";
}
const long long int INF = 0xFFFFFFFFFFFFFFFL;
long long int seed;
mt19937 rng(seed = chrono::steady_clock::now().time_since_epoch().count());
inline long long int rnd(long long int l = 0, long long int r = INF) {
  return uniform_int_distribution<long long int>(l, r)(rng);
}
class CMP {
 public:
  bool operator()(pair<long long int, long long int> a,
                  pair<long long int, long long int> b) {
    return !(a.first < b.first || a.first == b.first && a.second <= b.second);
  }
};
void add(map<long long int, long long int> &m, long long int x,
         long long int cnt = 1) {
  auto jt = m.find(x);
  if (jt == m.end())
    m.insert({x, cnt});
  else
    jt->second += cnt;
}
void del(map<long long int, long long int> &m, long long int x,
         long long int cnt = 1) {
  auto jt = m.find(x);
  if (jt->second <= cnt)
    m.erase(jt);
  else
    jt->second -= cnt;
}
bool cmp(const pair<long long int, long long int> &a,
         const pair<long long int, long long int> &b) {
  return a.first > b.first || (a.first == b.first && a.second < b.second);
}
const long long int mod = 1000000007L;
const long long int maxT = 2500;
const long long int N = 51;
const long long int M = 3;
long long int T, n, i, j, k, in, cnt[M + 2], l, r, u, v, x, y;
long long int m, g, ans;
string s;
vector<pair<long long int, long long int> > a;
long long int dp[M + 2][N + 5][N + 5][N + 5], suf[N + 5];
unordered_map<long long int, long long int> dpp[N + 5][maxT + 5];
long long int eval(long long int l, long long int x, long long int y,
                   long long int z) {
  if (x == 0 && y == 0 && z == 0) return 1;
  if (x < 0 || y < 0 || z < 0) return 0;
  long long int &ans = dp[l][x][y][z];
  if (ans != -1) return ans;
  ans = 0;
  if (l != 1) ans = (ans + x * eval(1, x - 1, y, z)) % mod;
  if (l != 2) ans = (ans + y * eval(2, x, y - 1, z)) % mod;
  if (l != 3) ans = (ans + z * eval(3, x, y, z - 1)) % mod;
  return ans;
}
long long int solve(long long int i, long long int len, long long int x,
                    long long int y, long long int z) {
  if (len > m) return 0;
  if (len + suf[i] < m) return 0;
  if (i == n) {
    if (len != m) return 0;
    return eval(0, x, y, z);
  }
  auto it = dpp[i][len].find(x * N * N + y * N + z);
  if (it != dpp[i][len].end()) return it->second;
  return dpp[i][len][x * N * N + y * N + z] =
             (solve(i + 1, len, x, y, z) +
              solve(i + 1, len + a[i].first, x + (a[i].second == 1),
                    y + (a[i].second == 2), z + (a[i].second == 3))) %
             mod;
}
int main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  {
    memset(dp, -1,
           (M + 2) * (N + 5) * (N + 5) * (N + 5) * sizeof(long long int));
    cin >> n >> m;
    a.clear();
    a.reserve(n);
    for (i = 0; i < (n); ++i) {
      cin >> in >> g;
      a.push_back({in, g});
      cnt[g]++;
    }
    sort(a.begin(), a.end(), cmp);
    for (i = (n - 1); i >= (0); --i) suf[i] = suf[i + 1] + a[i].first;
    cout << solve(0, 0, 0, 0, 0) << "\n";
  }
  aryanc403();
  return 0;
}
