#include <bits/stdc++.h>
using namespace std;
template <typename T>
T inverse(T a, T m) {
  T u = 0, v = 1;
  while (a != 0) {
    T t = m / a;
    m -= t * a;
    swap(a, m);
    u -= t * v;
    swap(u, v);
  }
  assert(m == 1);
  return u;
}
template <typename T>
class Modular {
 public:
  using Type = typename decay<decltype(T::value)>::type;
  constexpr Modular() : value() {}
  template <typename U>
  Modular(const U& x) {
    value = normalize(x);
  }
  template <typename U>
  static Type normalize(const U& x) {
    Type v;
    if (-mod() <= x && x < mod())
      v = static_cast<Type>(x);
    else
      v = static_cast<Type>(x % mod());
    if (v < 0) v += mod();
    return v;
  }
  const Type& operator()() const { return value; }
  template <typename U>
  explicit operator U() const {
    return static_cast<U>(value);
  }
  constexpr static Type mod() { return T::value; }
  Modular& operator+=(const Modular& other) {
    if ((value += other.value) >= mod()) value -= mod();
    return *this;
  }
  Modular& operator-=(const Modular& other) {
    if ((value -= other.value) < 0) value += mod();
    return *this;
  }
  template <typename U>
  Modular& operator+=(const U& other) {
    return *this += Modular(other);
  }
  template <typename U>
  Modular& operator-=(const U& other) {
    return *this -= Modular(other);
  }
  Modular& operator++() { return *this += 1; }
  Modular& operator--() { return *this -= 1; }
  Modular operator++(int) {
    Modular result(*this);
    *this += 1;
    return result;
  }
  Modular operator--(int) {
    Modular result(*this);
    *this -= 1;
    return result;
  }
  Modular operator-() const { return Modular(-value); }
  template <typename U = T>
  typename enable_if<is_same<typename Modular<U>::Type, int>::value,
                     Modular>::type&
  operator*=(const Modular& rhs) {
    value = normalize(static_cast<int64_t>(value) *
                      static_cast<int64_t>(rhs.value));
    return *this;
  }
  template <typename U = T>
  typename enable_if<is_same<typename Modular<U>::Type, long long>::value,
                     Modular>::type&
  operator*=(const Modular& rhs) {
    long long q = static_cast<long long>(static_cast<long double>(value) *
                                         rhs.value / mod());
    value = normalize(value * rhs.value - q * mod());
    return *this;
  }
  template <typename U = T>
  typename enable_if<!is_integral<typename Modular<U>::Type>::value,
                     Modular>::type&
  operator*=(const Modular& rhs) {
    value = normalize(value * rhs.value);
    return *this;
  }
  Modular& operator/=(const Modular& other) {
    return *this *= Modular(inverse(other.value, mod()));
  }
  friend const Type& abs(const Modular& x) { return x.value; }
  template <typename U>
  friend bool operator==(const Modular<U>& lhs, const Modular<U>& rhs);
  template <typename U>
  friend bool operator<(const Modular<U>& lhs, const Modular<U>& rhs);
  template <typename V, typename U>
  friend V& operator>>(V& stream, Modular<U>& number);

 private:
  Type value;
};
template <typename T>
bool operator==(const Modular<T>& lhs, const Modular<T>& rhs) {
  return lhs.value == rhs.value;
}
template <typename T, typename U>
bool operator==(const Modular<T>& lhs, U rhs) {
  return lhs == Modular<T>(rhs);
}
template <typename T, typename U>
bool operator==(U lhs, const Modular<T>& rhs) {
  return Modular<T>(lhs) == rhs;
}
template <typename T>
bool operator!=(const Modular<T>& lhs, const Modular<T>& rhs) {
  return !(lhs == rhs);
}
template <typename T, typename U>
bool operator!=(const Modular<T>& lhs, U rhs) {
  return !(lhs == rhs);
}
template <typename T, typename U>
bool operator!=(U lhs, const Modular<T>& rhs) {
  return !(lhs == rhs);
}
template <typename T>
bool operator<(const Modular<T>& lhs, const Modular<T>& rhs) {
  return lhs.value < rhs.value;
}
template <typename T>
Modular<T> operator+(const Modular<T>& lhs, const Modular<T>& rhs) {
  return Modular<T>(lhs) += rhs;
}
template <typename T, typename U>
Modular<T> operator+(const Modular<T>& lhs, U rhs) {
  return Modular<T>(lhs) += rhs;
}
template <typename T, typename U>
Modular<T> operator+(U lhs, const Modular<T>& rhs) {
  return Modular<T>(lhs) += rhs;
}
template <typename T>
Modular<T> operator-(const Modular<T>& lhs, const Modular<T>& rhs) {
  return Modular<T>(lhs) -= rhs;
}
template <typename T, typename U>
Modular<T> operator-(const Modular<T>& lhs, U rhs) {
  return Modular<T>(lhs) -= rhs;
}
template <typename T, typename U>
Modular<T> operator-(U lhs, const Modular<T>& rhs) {
  return Modular<T>(lhs) -= rhs;
}
template <typename T>
Modular<T> operator*(const Modular<T>& lhs, const Modular<T>& rhs) {
  return Modular<T>(lhs) *= rhs;
}
template <typename T, typename U>
Modular<T> operator*(const Modular<T>& lhs, U rhs) {
  return Modular<T>(lhs) *= rhs;
}
template <typename T, typename U>
Modular<T> operator*(U lhs, const Modular<T>& rhs) {
  return Modular<T>(lhs) *= rhs;
}
template <typename T>
Modular<T> operator/(const Modular<T>& lhs, const Modular<T>& rhs) {
  return Modular<T>(lhs) /= rhs;
}
template <typename T, typename U>
Modular<T> operator/(const Modular<T>& lhs, U rhs) {
  return Modular<T>(lhs) /= rhs;
}
template <typename T, typename U>
Modular<T> operator/(U lhs, const Modular<T>& rhs) {
  return Modular<T>(lhs) /= rhs;
}
template <typename T, typename U>
Modular<T> power(const Modular<T>& a, const U& b) {
  assert(b >= 0);
  Modular<T> x = a, res = 1;
  U p = b;
  while (p > 0) {
    if (p & 1) res *= x;
    x *= x;
    p >>= 1;
  }
  return res;
}
template <typename T>
bool IsZero(const Modular<T>& number) {
  return number() == 0;
}
template <typename T>
string to_string(const Modular<T>& number) {
  return to_string(number());
}
template <typename U, typename T>
U& operator<<(U& stream, const Modular<T>& number) {
  return stream << number();
}
template <typename U, typename T>
U& operator>>(U& stream, Modular<T>& number) {
  typename common_type<typename Modular<T>::Type, long long>::type x;
  stream >> x;
  number.value = Modular<T>::normalize(x);
  return stream;
}
using ModType = int;
struct VarMod {
  static ModType value;
};
ModType VarMod::value;
ModType& md = VarMod::value;
using Mint = Modular<VarMod>;
const int MAXN = 52;
Mint f[MAXN][MAXN][MAXN][3];
bool z[MAXN][MAXN][MAXN][3];
Mint DP(int a, int b, int c, int t) {
  if (a < 0 || b < 0 || c < 0) return 0;
  if (z[a][b][c][t]) return f[a][b][c][t];
  z[a][b][c][t] = true;
  if (t == 0) {
    if (a == 1 && b == 0 && c == 0) return f[a][b][c][t] = 1;
    f[a][b][c][t] += DP(a - 1, b, c, 1);
    f[a][b][c][t] += DP(a - 1, b, c, 2);
  }
  if (t == 1) {
    if (a == 0 && b == 1 && c == 0) return f[a][b][c][t] = 1;
    f[a][b][c][t] += DP(a, b - 1, c, 0);
    f[a][b][c][t] += DP(a, b - 1, c, 2);
  }
  if (t == 2) {
    if (a == 0 && b == 0 && c == 1) return f[a][b][c][t] = 1;
    f[a][b][c][t] += DP(a, b, c - 1, 0);
    f[a][b][c][t] += DP(a, b, c - 1, 1);
  }
  return f[a][b][c][t];
}
const int MAXT = 2510;
vector<int> x[3];
Mint cnt[3][MAXT][MAXN];
vector<pair<int, Mint>> ct[3][MAXT];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  md = 1000000007;
  int n, T;
  cin >> n >> T;
  for (int i = 0; i < n; ++i) {
    int t, g;
    cin >> t >> g;
    x[g - 1].push_back(t);
  }
  for (int g = 0; g < 3; ++g) {
    cnt[g][0][0] = 1;
    int R = 0;
    for (int i = 0; i < x[g].size(); ++i) {
      for (int j = i; j >= 0; --j) {
        for (int k = R; k >= 0; --k) {
          cnt[g][k + x[g][i]][j + 1] += cnt[g][k][j];
        }
      }
      R += x[g][i];
    }
    for (int i = 0; i <= T; ++i) {
      for (int j = 0; j <= x[g].size(); ++j) {
        if (cnt[g][i][j] == 0) continue;
        ct[g][i].push_back({j, cnt[g][i][j]});
      }
    }
  }
  vector<Mint> fac{1};
  for (int i = 1; i <= n; ++i) fac.push_back(fac[i - 1] * i);
  Mint ans = 0;
  for (int i = 0; i <= T; ++i) {
    if (ct[0][i].empty()) continue;
    for (int j = 0; j + i <= T; ++j) {
      if (ct[1][j].empty() || ct[2][T - i - j].empty()) continue;
      for (auto [a, ma] : ct[0][i]) {
        for (auto [b, mb] : ct[1][j]) {
          for (auto [c, mc] : ct[2][T - i - j]) {
            Mint sum = DP(a, b, c, 0) + DP(a, b, c, 1) + DP(a, b, c, 2);
            ans += ma * mb * mc * sum * fac[a] * fac[b] * fac[c];
          }
        }
      }
    }
  }
  cout << ans << endl;
  return 0;
}
