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 JAVA):

Solution:
import java.io.*;
import java.util.*;

public class Main {

    private FastScanner in;
    private PrintWriter out;

    final int MOD = (int)(1e9 + 7);

    final int dr[] = {-1, 0, 1, 0};
    final int dc[] = {0, -1, 0, 1};

    public void solve() {
        int n = in.nextInt();
        int m = in.nextInt();
        String[] grid = new String[n];
        for (int i = 0; i < n; i++) {
            grid[i] = in.next();
        }
        int pathLength = n + m - 1;
        int[][] f = new int[n][n];
        if (pathLength % 2 == 1) {
            for (int i = 0; i <= pathLength / 2 && i < n; i++) {
                f[i][i] = 1;
            }
        } else {
            for (int i = 0; i < pathLength / 2 && i < n; i++) {
                int j = pathLength / 2 - 1 - i;
                if (j < 0 || j >= m) {
                    continue;
                }
                if (j + 1 < m && grid[i].charAt(j) == grid[i].charAt(j + 1)) {
                    f[i][i] = 1;
                }
                if (i + 1 < n && grid[i].charAt(j) == grid[i + 1].charAt(j)) {
                    f[i][i + 1] = 1;
                }
            }
        }
        for (int sum = (pathLength + 1) / 2 - 1; sum > 0; sum--) {
            int[][] nf = new int[n][n];
            for (int pr = 0; pr < n; pr++) {
                for (int qr = 0; qr < n; qr++) {
                    if (f[pr][qr] > 0) {
                        int pc = sum - pr;
                        int qc = n - 1 - qr + m - 1 - sum;
                        if (pc < 0 || pc >= m || qc < 0 || qc >= m) {
                            continue;
                        }
                        for (int i = 0; i < 2; i++) {
                            int npr = pr + dr[i];
                            int npc = pc + dc[i];
                            if (npr < 0 || npr >= n || npc < 0 || npc >= m) {
                                continue;
                            }
                            for (int j = 2; j < 4; j++) {
                                int nqr = qr + dr[j];
                                int nqc = qc + dc[j];
                                if (nqr < 0 || nqr >= n || nqc < 0 || nqc >= m) {
                                    continue;
                                }
                                if (grid[npr].charAt(npc) == grid[nqr].charAt(nqc)) {
                                    nf[npr][nqr] += f[pr][qr];
                                    if (nf[npr][nqr] >= MOD) {
                                        nf[npr][nqr] -= MOD;
                                    }
                                }
                            }
                        }
                    }
                }
            }
            f = nf;
        }
        out.println(f[0][n - 1]);
    }

    public void run() {
        in = new FastScanner(System.in);
        out = new PrintWriter(System.out);

        solve();

        out.close();
    }

    public static void main(String[] args) {
        new Main().run();
    }

    class FastScanner {
        private BufferedReader br;
        private StringTokenizer st;

        public FastScanner(InputStream stream) {
            br = new BufferedReader(new InputStreamReader(stream));
        }

        public String next() {
            if (!hasMoreElements()) {
                return null;
            }
            return st.nextToken();
        }

        public boolean hasMoreElements() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    String line = br.readLine();
                    if (line == null) {
                        return false;
                    }
                    st = new StringTokenizer(line);
                } catch (IOException e) {
                    return false;
                }
            }
            return true;
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public Long nextLong() {
            return Long.parseLong(next());
        }

        public Double nextDouble() {
            return Double.parseDouble(next());
        }
    }

}