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
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void amin(T &x, const T &y) {
  if (y < x) x = y;
}
template <class T>
inline void amax(T &x, const T &y) {
  if (x < y) x = y;
}
template <class Iter>
void rprintf(const char *fmt, Iter begin, Iter end) {
  for (bool sp = 0; begin != end; ++begin) {
    if (sp)
      putchar(' ');
    else
      sp = true;
    printf(fmt, *begin);
  }
  putchar('\n');
}
template <class Mint, int SIZE>
struct MintArrBase {
  Mint d[SIZE];
  MintArrBase() { clear(); }
  MintArrBase(const MintArrBase &y) { memcpy(d, y.d, sizeof d); }
  void clear() { memset(d, 0, sizeof d); }
  Mint &operator[](int i) { return d[i]; }
  const Mint &operator[](int i) const { return d[i]; }
  Mint &get(int i) { return d[i]; }
  const Mint &get(int i) const { return d[i]; }
  void set(int i, const Mint &v) { d[i] = v; }
  void add(int i, const Mint &v) { d[i] += v; }
  MintArrBase &operator+=(const MintArrBase &y) {
    for (int i = 0; i < SIZE; i++) d[i] += y.d[i];
    return *this;
  }
  MintArrBase &operator-=(const MintArrBase &y) {
    for (int i = 0; i < SIZE; i++) d[i] -= y.d[i];
    return *this;
  }
  MintArrBase operator+(const MintArrBase &y) const {
    return MintArrBase(*this) += y;
  }
  MintArrBase operator-(const MintArrBase &y) const {
    return MintArrBase(*this) -= y;
  }
  bool operator==(const MintArrBase &y) const {
    for (int i = 0; i < SIZE; i++)
      if (d[i] != y.d[i]) return false;
    return true;
  }
  bool operator!=(const MintArrBase &y) const { return !(*this == y); }
  friend string to_string(const MintArrBase &x) {
    string s;
    char buf[21];
    for (int i = 0; i < SIZE; i++) {
      sprintf(buf, "%d", x[i].geti());
      s += buf;
      if (i < SIZE - 1) s += " ";
    }
    return s;
  }
};
template <class Mint, int ROW, int COL>
struct MintMatBase {
  static const int SIZE = ROW * COL;
  Mint d[SIZE];
  MintMatBase() { clear(); }
  MintMatBase(const MintMatBase &y) { memcpy(d, y.d, sizeof d); }
  void clear() { memset(d, 0, sizeof d); }
  Mint *operator[](int r) { return d + r * COL; }
  const Mint *operator[](int r) const { return d + r * COL; }
  Mint &get(int r, int c) { return d[r * COL + c]; }
  const Mint &get(int r, int c) const { return d[r * COL + c]; }
  void set(int r, int c, const Mint &v) { d[r * COL + c] = v; }
  void add(int r, int c, const Mint &v) { d[r * COL + c] += v; }
  MintMatBase &operator+=(const MintMatBase &y) {
    for (int i = 0; i < SIZE; i++) d[i] += y.d[i];
    return *this;
  }
  MintMatBase &operator-=(const MintMatBase &y) {
    for (int i = 0; i < SIZE; i++) d[i] -= y.d[i];
    return *this;
  }
  template <int COL2>
  MintMatBase<Mint, ROW, COL2> &operator*=(
      const MintMatBase<Mint, COL, COL2> &y) {
    return *this = *this * y;
  }
  MintMatBase operator+(const MintMatBase &y) const {
    return MintMatBase(*this) += y;
  }
  MintMatBase operator-(const MintMatBase &y) const {
    return MintMatBase(*this) -= y;
  }
  template <int COL2>
  MintMatBase<Mint, ROW, COL2> operator*(
      const MintMatBase<Mint, COL, COL2> &y) const {
    static MintMatBase r;
    static unsigned long long buf[COL2];
    for (int i = 0; i < ROW; i++) {
      memset(buf, 0, sizeof buf);
      int k = 0;
      for (; k <= COL - 16; k += 16) {
        for (int k_ = k; k_ < k + 16; k_++)
          for (int j = 0; j < COL2; j++)
            buf[j] +=
                (unsigned long long)d[i * COL + k_].x * y.d[k_ * COL2 + j].x;
        for (int j = 0; j < COL2; j++)
          buf[j] %= (unsigned long long)Mint::static_MOD;
      }
      for (; k < COL; k++)
        for (int j = 0; j < COL2; j++)
          buf[j] += (unsigned long long)d[i * COL + k].x * y.d[k * COL2 + j].x;
      for (int j = 0; j < COL2; j++) r.d[i * COL2 + j] = Mint(buf[j]);
    }
    return r;
  }
  MintArrBase<Mint, ROW> operator*(const MintArrBase<Mint, COL> &y) const {
    static MintArrBase<Mint, ROW> r;
    for (int i = 0; i < ROW; i++) {
      unsigned long long buf = 0;
      int j = 0;
      for (; j <= COL - 16; j += 16) {
        for (int j_ = j; j_ < j + 16; j_++)
          buf += (unsigned long long)d[i * COL + j_].x * y.d[j_].x;
        buf %= Mint::static_MOD;
      }
      for (; j < COL; j++)
        buf += (unsigned long long)d[i * COL + j].x * y.d[j].x;
      r.d[i] = Mint(buf);
    }
    return r;
  }
  MintMatBase pow(unsigned long long y) const {
    static MintMatBase x, r;
    x = *this;
    r = I();
    for (; y; y >>= 1) {
      if (y & 1) r = r * x;
      x = x * x;
    }
    return r;
  }
  MintArrBase<Mint, ROW> powmul(unsigned long long y,
                                MintArrBase<Mint, ROW> z) const {
    static_assert(ROW == COL, "");
    static MintMatBase x;
    x = *this;
    for (; y; y >>= 1) {
      if (y & 1) z = x * z;
      x = x * x;
    }
    return z;
  }
  bool operator==(const MintMatBase &y) const {
    for (int i = 0; i < SIZE; i++)
      if (d[i] != y.d[i]) return false;
    return true;
  }
  bool operator!=(const MintMatBase &y) const { return !(*this == y); }
  static const MintMatBase I() {
    static MintMatBase I_ = MintMatBase();
    if (I_.d[0] == 0)
      for (int i = 0; i < min(ROW, COL); i++) I_.set(i, i, 1);
    return I_;
  }
  friend string to_string(const MintMatBase &x) {
    string s;
    char buf[21];
    for (int i = 0; i < ROW; i++) {
      for (int j = 0; j < COL; j++) {
        sprintf(buf, "%d", x.get(i, j).geti());
        s += buf;
        s += " \n"[j == COL - 1];
      }
    }
    return s;
  }
};
template <unsigned MOD>
struct ModInt {
  static const unsigned static_MOD = MOD;
  unsigned x;
  void undef() { x = (unsigned)-1; }
  bool isnan() const { return x == (unsigned)-1; }
  inline int geti() const { return (int)x; }
  ModInt() { x = 0; }
  ModInt(const ModInt &y) { x = y.x; }
  ModInt(int y) {
    if (y < 0 || (int)MOD <= y) y %= (int)MOD;
    if (y < 0) y += MOD;
    x = y;
  }
  ModInt(unsigned y) {
    if (MOD <= y)
      x = y % MOD;
    else
      x = y;
  }
  ModInt(long long y) {
    if (y < 0 || MOD <= y) y %= MOD;
    if (y < 0) y += MOD;
    x = y;
  }
  ModInt(unsigned long long y) {
    if (MOD <= y)
      x = y % MOD;
    else
      x = y;
  }
  ModInt &operator+=(const ModInt y) {
    if ((x += y.x) >= MOD) x -= MOD;
    return *this;
  }
  ModInt &operator-=(const ModInt y) {
    if ((x -= y.x) & (1u << 31)) x += MOD;
    return *this;
  }
  ModInt &operator*=(const ModInt y) {
    x = (unsigned long long)x * y.x % MOD;
    return *this;
  }
  ModInt &operator/=(const ModInt y) {
    x = (unsigned long long)x * y.inv().x % MOD;
    return *this;
  }
  ModInt operator-() const { return (x ? MOD - x : 0); }
  ModInt inv() const {
    unsigned a = MOD, b = x;
    int u = 0, v = 1;
    while (b) {
      int t = a / b;
      a -= t * b;
      swap(a, b);
      u -= t * v;
      swap(u, v);
    }
    if (u < 0) u += MOD;
    return ModInt(u);
  }
  ModInt pow(long long y) const {
    ModInt b = *this, r = 1;
    if (y < 0) {
      b = b.inv();
      y = -y;
    }
    for (; y; y >>= 1) {
      if (y & 1) r *= b;
      b *= b;
    }
    return r;
  }
  friend ModInt operator+(ModInt x, const ModInt y) { return x += y; }
  friend ModInt operator-(ModInt x, const ModInt y) { return x -= y; }
  friend ModInt operator*(ModInt x, const ModInt y) { return x *= y; }
  friend ModInt operator/(ModInt x, const ModInt y) { return x *= y.inv(); }
  friend bool operator<(const ModInt x, const ModInt y) { return x.x < y.x; }
  friend bool operator==(const ModInt x, const ModInt y) { return x.x == y.x; }
  friend bool operator!=(const ModInt x, const ModInt y) { return x.x != y.x; }
};
const long long MOD = 1000000007;
const int SIZE = 105;
const int ROW = SIZE;
const int COL = SIZE;
struct KMP {
  vector<int> fail;
  string p;
  KMP() {}
  KMP(const string &p) : p(p) {
    int m = p.size();
    fail = vector<int>(m + 1);
    int j = fail[0] = -1;
    for (int i = 1; i <= m; i++) {
      while (j >= 0 && p[j] != p[i - 1]) j = fail[j];
      fail[i] = ++j;
    }
  }
  vector<int> match(const string &t) {
    int n = t.size(), m = p.size();
    vector<int> ret;
    for (int i = 0, k = 0; i < n; i++) {
      while (k >= 0 && p[k] != t[i]) k = fail[k];
      if (++k >= m) {
        ret.push_back(i);
        k = fail[k];
      }
    }
    return ret;
  }
};
int N, X;
char S[111];
MintMatBase<ModInt<MOD>, ROW, COL> F[111];
void MAIN() {
  scanf("%d%d", &N, &X);
  scanf("%s", S);
  KMP kmp(S);
  MintMatBase<ModInt<MOD>, ROW, COL>
      m0 = MintMatBase<ModInt<MOD>, ROW, COL>::I(),
      m1 = MintMatBase<ModInt<MOD>, ROW, COL>::I();
  m0.add(SIZE - 1, SIZE - 1, 1);
  m1.add(SIZE - 1, SIZE - 1, 1);
  for (int i = 0, i_len = (N); i < i_len; ++i) {
    int k;
    k = i;
    while (k >= 0 && S[k] != '0') k = kmp.fail[k];
    if (++k >= N) {
      m0.add(SIZE - 1, i, 1);
      k = kmp.fail[k];
    }
    m0.add(k, i, 1);
    k = i;
    while (k >= 0 && S[k] != '1') k = kmp.fail[k];
    if (++k >= N) {
      m1.add(SIZE - 1, i, 1);
      k = kmp.fail[k];
    }
    m1.add(k, i, 1);
  }
  F[0] = m0;
  F[1] = m1;
  for (int i = 2; i <= X; i++) F[i] = F[i - 2] * F[i - 1];
  MintArrBase<ModInt<MOD>, COL> a;
  a.set(0, 1);
  MintArrBase<ModInt<MOD>, COL> b = F[X] * a;
  int ans = b.get(SIZE - 1).geti();
  printf("%d\n", ans);
}
int main() {
  int TC = 1;
  for (int tc = 0, tc_len = (TC); tc < tc_len; ++tc) MAIN();
  return 0;
}
