#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// #define int long long
// #define double long double
#define rep(i,n) for (int i=0; i<(int)(n); ++i)
#define rep1(i,n) for (int i=1; i<(int)(n); ++i)
#define repeq(i,n) for (int i=0; i<=(int)(n); ++i)
#define rep1eq(i,n) for (int i=1; i<=(int)(n); ++i)
#define rrep(i,n) for (int i=(int)(n)-1; i>=0; --i)
#define rrep1(i,n) for (int i=(int)(n)-1; i>0; --i)
#define rrepeq(i,n) for (int i=(int)(n); i>=0; --i)
#define rrep1eq(i,n) for (int i=(int)(n); i>0; --i)
#define REP(i,a,b) for (int i=(int)(a); i<=(int)(b); ++i)
#define RREP(i,a,b) for (int i=(int)(a); i>=(int)(b); --i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
template<typename T> using Graph = vector<vector<T>>;
template<typename T> using Spacial = vector<vector<vector<T>>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = 1e9+7;
const int MOD2 = 998244353;
// const double EPS = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
string interval[2] = {" ", "\n"}; // {" ", "\n"}

template<typename T> struct is_plural : false_type{};
template<typename T1, typename T2> struct is_plural<pair<T1, T2>> : true_type{};
template<typename T> struct is_plural<vector<T>> : true_type{};
template<typename T> struct is_plural<complex<T>> : true_type{};
 
template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << " " << p.second; }
template<typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto itr = vec.begin(); itr != vec.end(); ++itr) is >> *itr; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { if (vec.empty()) return os; bool pl = is_plural<T>(); os << vec.front(); for (auto itr = ++vec.begin(); itr != vec.end(); ++itr) os << interval[pl] << *itr; return os; }
 
bool CoutYN(bool a, string y = "Yes", string n = "No") { cout << (a ? y : n) << "\n"; return a; }

template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

long long modpow(int a, long long n, int mod = MOD) { long long ret = 1; do { if (n & 1) ret = ret * a % mod; a = 1LL * a * a % mod; } while (n >>= 1); return ret; }

template<typename T> T GCD(T a, T b) { return b ? GCD(b, a%b) : a; }
template<typename T> T LCM(T a, T b) { return a / GCD(a, b) * b; }

template<typename T1, typename T2> bool CompareBySecond(pair<T1, T2> a, pair<T1, T2> b) { return a.second != b.second ? a.second < b.second : a.first < b.first; }
template<typename T1, typename T2> bool CompareByInverse(pair<T1, T2> a, pair<T1, T2> b) { return a.first != b.first ? a.first < b.first : a.second > b.second; }


/* -------- <templates end> -------- */


struct Combination {
  vector<long long> fac, finv, inv;
  const int mod;

  Combination(int MAX, int mod = MOD) : fac(MAX + 1), finv(MAX + 1), inv(MAX + 1), mod(mod) {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i=2; i<=MAX; ++i) {
      fac[i] = fac[i-1] * i % mod;
      inv[i] = mod - inv[mod%i] * (mod/i) % mod;
      finv[i] = finv[i-1] * inv[i] % mod;
    }
  }

  long long P(int n, int r) const {
    if (n < r || n < 0 || r < 0) return 0;
    return fac[n] * finv[n-r] % mod;
  }

  long long C(int n, int r) const {
    if (n < r || n < 0 || r < 0) return 0;
    return fac[n] * (finv[r] * finv[n-r] % mod) % mod;
  }

  long long H(int n, int r) const {
    if (n < r || n < 0 || r < 0) return 0;
    return C(n + r - 1, r);
  }
};

struct path {
  int l, r;

  path(int l, int r) : l(l), r(r) {}
};

void solve() {
  int n, m; cin >> n >> m;
  string s; cin >> s;

  vector<path> g;
  rep(i,m) {
    int l, r; cin >> l >> r; --l;
    if (!g.empty() && l == g.back().l) {
      chmax(g.back().r, r);
    } else if (g.empty() || r > g.back().r) {
      g.emplace_back(l, r);
    }
  }

  m = g.size();
  g.emplace_back(n, n);

  vector<path> sum(m+1, {0, 0});
  rep(j, g[0].l) {
    sum[0].l += s[j] - '0';
  }
  rep(j, g[0].r) {
    sum[0].r += s[j] - '0';
  }

  rep1eq(i,m) {
    sum[i] = sum[i-1];
    REP(j, g[i-1].l, g[i].l - 1) {
      sum[i].l += s[j] - '0';
    }
    REP(j, g[i-1].r, g[i].r - 1) {
      sum[i].r += s[j] - '0';
    }
  }
  
  Graph<int> dp(m+1, vi(n+1, 0));
  dp[0][sum[0].l] = 1;

  Combination comb(n);

  rep(i,m) {
    if (g[i].r <= g[i+1].l) {
      repeq(j, g[i].l) if (dp[i][j] != 0) {
        (dp[i+1][sum[i+1].l] += dp[i][j] * comb.C(g[i].r - g[i].l, sum[i].r - j) % MOD) %= MOD;
      }
      continue;
    }

    repeq(j,g[i].l) if (dp[i][j] != 0) {
      int MIN = max((g[i+1].l - g[i].r) + (sum[i].r - j), 0);
      int MAX = min(sum[i].r - j, g[i+1].l - g[i].l);

      REP(k, MIN, MAX) {
        (dp[i+1][j+k] += dp[i][j] * comb.C(g[i+1].l - g[i].l, k) % MOD) %= MOD;
      }
    }
  }

  int ans = accumulate(ALL(dp[m]), 0LL) % MOD;
  cout << ans << endl;
}


/* -------- <programs end> -------- */


signed main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  solve();
  return 0;
}


Measured memory_bytes: 15104