Problem: Peppa the Pig was walking and walked into the forest. What a strange coincidence! The forest has the shape of a rectangle, consisting of n rows and m columns. We enumerate the rows of the rectangle from top to bottom with numbers from 1 to n, and the columns — from left to right with numbers from 1 to m. Let's denote the cell at the intersection of the r-th row and the c-th column as (r, c).

Initially the pig stands in cell (1, 1), and in the end she wants to be in cell (n, m). Since the pig is in a hurry to get home, she can go from cell (r, c), only to either cell (r + 1, c) or (r, c + 1). She cannot leave the forest.

The forest, where the pig is, is very unusual. Some cells of the forest similar to each other, and some look very different. Peppa enjoys taking pictures and at every step she takes a picture of the cell where she is now. The path through the forest is considered to be beautiful if photographs taken on her way, can be viewed in both forward and in reverse order, showing the same sequence of photos. More formally, the line formed by the cells in order of visiting should be a palindrome (you can read a formal definition of a palindrome in the previous problem).

Count the number of beautiful paths from cell (1, 1) to cell (n, m). Since this number can be very large, determine the remainder after dividing it by 109 + 7.

Input

The first line contains two integers n, m (1 ≤ n, m ≤ 500) — the height and width of the field.

Each of the following n lines contains m lowercase English letters identifying the types of cells of the forest. Identical cells are represented by identical letters, different cells are represented by different letters.

Output

Print a single integer — the number of beautiful paths modulo 109 + 7.

Examples

Input

3 4
aaab
baaa
abba


Output

3

Note

Picture illustrating possibilities for the sample test. 

<image>

<image>

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const long long int INFLL = 1e18;
const double EPS = 1e-8;
template <class T>
T &chmin(T &a, const T &b) {
  return a = min(a, b);
}
template <class T>
T &chmax(T &a, const T &b) {
  return a = max(a, b);
}
long long int in() {
  long long int a;
  cin >> a;
  return a;
}
const int MOD = 1e9 + 7;
struct Mod {
  long long int n;
  Mod() {}
  Mod(long long int n) : n((n % MOD + MOD) % MOD) {}
};
Mod operator+(Mod a, Mod b) { return Mod((a.n + b.n) % MOD); }
Mod operator+=(Mod &a, Mod b) { return a = a + b; }
Mod operator-(Mod a, Mod b) { return Mod((a.n + MOD - b.n) % MOD); }
Mod operator-=(Mod &a, Mod b) { return a = a - b; }
Mod operator*(Mod a, Mod b) { return Mod((a.n * b.n) % MOD); }
Mod operator*=(Mod &a, Mod b) { return a = a * b; }
Mod modpow(Mod x, long long int k) {
  Mod res = 1;
  while (k) {
    if (k & 1) res *= x;
    k /= 2;
    x *= x;
  }
  return res;
}
Mod inv(Mod a) { return modpow(a, MOD - 2); }
Mod operator/(Mod a, Mod b) { return Mod((a.n * inv(b).n) % MOD); }
Mod operator/=(Mod &a, Mod b) { return a = a / b; }
const int MAX_N = 512;
int n, m;
string ts[MAX_N];
int s[MAX_N][MAX_N];
long long int dp[2][MAX_N][MAX_N];
int main() {
  cin >> n >> m;
  for (int i = (0); i < (int)(n); i++) cin >> ts[i];
  if (n < m) {
    for (int i = (0); i < (int)(n); i++)
      for (int j = (0); j < (int)(m); j++) s[i][j] = ts[i][j] - 'a';
  } else {
    for (int i = (0); i < (int)(m); i++)
      for (int j = (0); j < (int)(n); j++) s[i][j] = ts[j][i] - 'a';
    swap(n, m);
  }
  dp[0][0][0] = 1;
  if (s[0][0] != s[n - 1][m - 1]) dp[0][0][0] = 0;
  int ni, nj, nk, l, o;
  for (int i = (0); i < (int)((n + m) / 2 - 1); i++) {
    for (int j = (0); j < (int)(min(i + 2, n)); j++)
      for (int k = (0); k < (int)(min(i + 2, n)); k++)
        dp[(i + 1) & 1][j][k] = 0;
    for (int j = (0); j < (int)(min(i + 1, n)); j++) {
      for (int k = (0); k < (int)(min(i + 1, n)); k++) {
        for (l = 0; l < 2; l++) {
          for (o = 0; o < 2; o++) {
            ni = i + 1;
            nj = j + l;
            nk = k + o;
            if (nj >= n || nk >= n) continue;
            if (s[nj][ni - nj] == s[n - 1 - nk][m - 1 - ni + nk]) {
              dp[ni & 1][nj][nk] += dp[i & 1][j][k];
              dp[ni & 1][nj][nk] %= MOD;
            }
          }
        }
      }
    }
  }
  int t = (m + n) / 2 - 1;
  Mod ans = 0;
  if ((n + m) % 2 == 0) {
    for (int i = (0); i < (int)(n); i++) ans += dp[t & 1][i][n - 1 - i];
  } else {
    for (int i = (0); i < (int)(n); i++) {
      for (int j = (0); j < (int)(2); j++) {
        int k = (n - i - 1) - j;
        if (k < 0) continue;
        if (s[i][t - i] == s[i + j][t - i + 1 - j]) ans += dp[t & 1][i][k];
      }
    }
  }
  cout << ans.n << endl;
  return 0;
}