#include <bits/stdc++.h>
using namespace std;
void fast() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
}
const long long INFll = 1ll * 1000000000 * 1000000000;
const long double PI =
    3.141592653589793238462643383279502884197169399375105820974944;
int mul(int a, int b, int mod = 1000000007) { return int(a * 1ll * b % mod); }
int norm(int a, int mod = 1000000007) {
  while (a >= mod) a -= mod;
  while (a < 0) a += mod;
  return a;
}
int powmod(int x, int y, int mod = 1000000007) {
  int res = 1;
  while (y > 0) {
    if (y & 1) res = mul(res, x, mod);
    x = mul(x, x, mod);
    y = y >> 1;
  }
  return res;
}
int inv(int a, int mod = 1000000007) { return powmod(a, mod - 2); }
int dp[33000][3];
int main() {
  fast();
  int n, T;
  long long ans = 0;
  cin >> n >> T;
  vector<int> g(n), t(n);
  int p = (1 << n);
  for (int i = 0; i < n; i++) {
    cin >> t[i] >> g[i];
    g[i]--;
  }
  for (int i = 0; i < p; i++) {
    if (i == 0) {
      for (int k = 0; k < n; k++) {
        dp[(1 << k)][g[k]] = 1;
      }
      continue;
    }
    for (int j = 0; j < 3; j++) {
      for (int k = 0; k < n; k++) {
        if (((1 << k) & i) == 0 && j != g[k]) {
          dp[i | (1 << k)][g[k]] =
              (dp[i | (1 << k)][g[k]] + dp[i][j]) % 1000000007;
        }
      }
    }
    int res = 0;
    for (int k = 0; k < n; k++) {
      if (i & (1 << k)) {
        res += t[k];
      }
    }
    if (res == T) {
      ans = (ans + dp[i][0] + dp[i][1] + dp[i][2]) % 1000000007;
    }
  }
  cout << ans << '\n';
  return 0;
}
