#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <fstream>
#include <iomanip>
#include <cassert>
//#include <utility>
//#include <memory>
//#include <functional>
//#include <deque>
//#include <cctype>
//#include <ctime>
//#include <numeric>
//#include <list>
//#include <iomanip>

//#if __cplusplus >= 201103L
//#include <array>
//#include <tuple>
//#include <initializer_list>
//#include <forward_list>
//
//#define cauto const auto&
//#else

//#endif

using namespace std;


typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(),(v).rend()
#define DEBUG
#ifdef DEBUG
#define dump(x)  cout << #x << " = " << (x) << endl;
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#else
#define dump(x) 
#define debug(x) 
#endif

#define MOD 1000000007LL
#define EPS 1e-8
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
#define maxs(x,y) x=max(x,y)
#define mins(x,y) x=min(x,y)


// Mod int
// const int MOD = 1000000007;
struct mint{
    ll x;
    mint():x(0){}
    mint(ll x):x((x%MOD+MOD)%MOD){}
    mint operator+=(const mint& a){ if((x+=a.x)>=MOD) x-=MOD; return *this;}
    mint operator-=(const mint& a){ if((x+=MOD-a.x)>=MOD) x-=MOD; return *this;}
    mint operator*=(const mint& a){ (x*=a.x)%=MOD; return *this;}
    mint operator+(const mint& a)const{ return mint(*this) += a;}
    mint operator-(const mint& a)const{ return mint(*this) -= a;}
    mint operator*(const mint& a)const{ return mint(*this) *= a;}
    bool operator==(const mint& a)const{ return x == a.x;}
    friend ostream& operator<<(ostream& os, const mint& mi)  
	{  
	    os << mi.x;  
	    return os;  
	}  
};

mint dp[3010][3010];

void mainmain(){
	int n,m;
	cin>>n>>m;
	string s;
	cin>>s;
	vector<pii> v(n);
	rep(i,n){
		cin>>v[i].F>>v[i].S;
		v[i].F--;
		v[i].S--;
	}
	vector<pii> w;
	rep(i,n){
		pii t=v[i];
		reep(j,i+1,n){
			if(t.F<v[j].F && t.S<v[j].S){
				break;
			}
			i=j;
			maxs(t.S,v[j].S);
		}
		w.PB(t);
	}
	int l = 0;
	int r = 0;
	w.PB(pll(n, n));
	dp[0][0].x=1;
	rep(i,w.size()-1){
		int ll = l;
		while(ll<w[i].F) ll++;
		rep(i,3010){
			dp[ll][i]=dp[l][i];
		}
		l=ll;
		int c = 0;
		maxs(r, l);
		while(r<=w[i].S){
			c += s[r]=='1';
			r++;
		}
		for(int j=n;j>=0;j--){
			dp[l][j+c]=dp[l][j];
		}
		rep(j,c){
			dp[l][j].x=0;
		}
		while(l<w[i+1].F && l<=w[i].S){
			rep(j,n){
				if(j) dp[l+1][j-1] += dp[l][j];
				if(w[i].S-l+1-j>0){
					dp[l+1][j] += dp[l][j];
				}
			}
			l++;
		}
	}
	mint ans;
	rep(i,3010){
		ans += dp[l][i];
	}
	cout<<ans.x<<endl;
}


signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout<<fixed<<setprecision(20);
    mainmain();
}

Measured memory_bytes: 71168