There is a string S of length N consisting of characters `0` and `1`. You will perform the following operation for each i = 1, 2, ..., m:

* Arbitrarily permute the characters within the substring of S starting at the l_i-th character from the left and extending through the r_i-th character.



Here, the sequence l_i is non-decreasing.

How many values are possible for S after the M operations, modulo 1000000007(= 10^9+7)?

Constraints

* 2≦N≦3000
* 1≦M≦3000
* S consists of characters `0` and `1`.
* The length of S equals N.
* 1≦l_i < r_i≦N
* l_i ≦ l_{i+1}

Input

The input is given from Standard Input in the following format:


N M
S
l_1 r_1
:
l_M r_M


Output

Print the number of the possible values for S after the M operations, modulo 1000000007.

Examples

Input

5 2
01001
2 4
3 5


Output

6


Input

9 3
110111110
1 4
4 6
6 9


Output

26


Input

11 6
00101000110
2 4
2 3
4 7
5 6
6 10
10 11


Output

143
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

public class Main {
  private final int MOD = (int) (1e9 + 7);

  private void solve(Scanner in, PrintWriter out) {
    int N = in.nextInt();
    int M = in.nextInt();
    char[] S = in.next().toCharArray();
    int[] right = new int[N];
    Arrays.fill(right, -1);
    for (int i = 0; i < M; i++) {
      int l = in.nextInt() - 1;
      int r = in.nextInt() - 1;
      if (right[l] < r) right[l] = r;
    }

    int max = 0;
    for (int i = 0; i < N; i++) {
      max = Math.max(max, i);
      max = Math.max(max, right[i]);
      right[i] = max;
    }

    int[] sum = new int[N];
    for (int i = 0; i < N; i++) sum[i] = S[i] - '0';
    for (int i = 0; i < N - 1; i++) sum[i + 1] += sum[i];

    long[][] dp = new long[N + 1][N + 1];
    dp[0][0] = 1;
    for (int i = 0; i < N; i++) {
      for (int usedOne = 0; usedOne < N; usedOne++) {
        int r = right[i];
        int restOne = sum[r] - usedOne;
        if (restOne < 0) continue;

        if (restOne > 0)
          dp[i + 1][usedOne + 1] = (dp[i + 1][usedOne + 1] + dp[i][usedOne]) % MOD;

        if (r - i + 1 != restOne)
          dp[i + 1][usedOne] = (dp[i + 1][usedOne] + dp[i][usedOne]) % MOD;
      }
    }
    out.println(dp[N][sum[N - 1]]);
  }

  public static void main(String[] args) {
    Scanner in = new Scanner(System.in);
    PrintWriter out = new PrintWriter(System.out);
    new Main().solve(in, out);
    in.close();
    out.close();
  }
}
