Problem: You are given a binary string s (each character of this string is either 0 or 1).

Let's denote the cost of string t as the number of occurences of s in t. For example, if s is 11 and t is 111011, then the cost of t is 3.

Let's also denote the Fibonacci strings sequence as follows:

  * F(0) is 0;
  * F(1) is 1;
  * F(i) = F(i - 1) + F(i - 2) if i > 1, where  +  means the concatenation of two strings.



Your task is to calculate the sum of costs of all subsequences of the string F(x). Since answer may be large, calculate it modulo 109 + 7.

Input

The first line contains two integers n and x (1 ≤ n ≤ 100, 0 ≤ x ≤ 100) — the length of s and the index of a Fibonacci string you are interested in, respectively.

The second line contains s — a string consisting of n characters. Each of these characters is either 0 or 1.

Output

Print the only integer — the sum of costs of all subsequences of the string F(x), taken modulo 109 + 7. 

Examples

Input

2 4
11


Output

14


Input

10 100
1010101010


Output

553403224

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
const int N = 105;
const long long M = 1000000007LL;
long long f[N][N][N], A[N] = {2, 2}, L, n;
char s[N];
void dp() {
  for (int i = 1; i <= L; ++i) f[s[i] - '0'][i][i] = 1;
  for (int i = 2; i <= n; ++i) {
    A[i] = (A[i - 1] * A[i - 2]) % M;
    for (int l = 1; l <= L; ++l)
      for (int r = l; r <= L; ++r) {
        f[i][l][r] += f[i - 1][l][r] * (r == L ? A[i - 2] : 1) % M;
        f[i][l][r] += f[i - 2][l][r] * (l == 1 ? A[i - 1] : 1) % M;
        for (int m = l; m < r; ++m)
          f[i][l][r] += f[i - 1][l][m] * f[i - 2][m + 1][r] % M;
        f[i][l][r] %= M;
      }
  }
}
int main() {
  scanf("%lld%lld%s", &L, &n, s + 1);
  dp();
  return !printf("%lld\n", f[n][1][L]);
}