#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimization("unroll-loops")
std::pair<int, int> DR[] = {{-1, 0}, {0, 1},   {1, 0}, {0, -1},
                            {-1, 1}, {-1, -1}, {1, 1}, {1, -1}};
using namespace std;
template <class c>
struct rge {
  c b, e;
};
template <class c>
rge<c> range(c i, c j) {
  return rge<c>{i, j};
}
template <class c>
auto dud(c* x) -> decltype(cerr << *x, 0);
template <class c>
char dud(...);
struct debug {
  ~debug() { cerr << endl; }
  template <class c>
  typename enable_if<sizeof dud<c>(0) != 1, debug&>::type operator<<(c i) {
    cerr << boolalpha << i;
    return *this;
  }
  template <class c>
  typename enable_if<sizeof dud<c>(0) == 1, debug&>::type operator<<(c i) {
    return *this << range(begin(i), end(i));
  }
  template <class c, class b>
  debug& operator<<(pair<b, c> d) {
    return *this << "(" << d.first << ", " << d.second << ")";
  }
  template <class c>
  debug& operator<<(rge<c> d) {
    *this << "[";
    for (auto it = d.b; it != d.e; ++it) *this << ", " + 2 * (it == d.b) << *it;
    return *this << "]";
  }
};
long long gcd(long long a, long long b) {
  if (b) return gcd(b, a % b);
  return a;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long n, T, t[50], g[50];
long long dp[1 << 15][250][3];
const long long mod = 1e9 + 7;
long long ans;
void add(long long& x, long long ad) {
  x += ad;
  if (x > mod) x -= mod;
}
long long exp(long long n, long long p) {
  long long ans = 1;
  for (long long i = 0; (1ll << i) <= p; i++) {
    if (p & (1ll << i)) {
      ans *= n;
      ans %= mod;
    }
    n *= n;
    n %= mod;
  }
  return ans;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cerr.tie(0);
  cout.tie(0);
  cin >> n >> T;
  for (long long i = 0; i < n; i++) {
    cin >> t[i] >> g[i];
  }
  dp[0][0][0] = dp[0][0][1] = dp[0][0][2] = 1;
  for (long long mask = 0; mask < (1 << n); mask++) {
    for (long long sum = 0; sum <= T; sum++) {
      for (long long i = 0; i < n; i++) {
        if (!(mask & (1 << i)) && sum + t[i] <= T) {
          long long x = g[i] - 1;
          for (long long c = 0; c < 3; c++) {
            if (c != x)
              add(dp[mask | (1 << i)][sum + t[i]][x], dp[mask][sum][c]);
          }
        }
      }
    }
    add(ans, dp[mask][T][0]);
    add(ans, dp[mask][T][1]);
    add(ans, dp[mask][T][2]);
  }
  long long inv = exp(2, mod - 2);
  return cout << (ans * inv) % mod, 0;
  return 0;
}
