use std::collections::HashSet;

const MOD: usize = 1e9 as usize + 7;
const SDX: [isize; 2] = [-1, 0];
const SDY: [isize; 2] = [0, -1];
const EDX: [usize; 2] = [1, 0];
const EDY: [usize; 2] = [0, 1];

fn main() {
    let mut hw = String::new();
    std::io::stdin().read_line(&mut hw).ok();
    let hw: Vec<usize> = hw.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
    let h = hw[0];
    let w = hw[1];
    let grid = (0..h).map(|_| {
            let mut temp = String::new();
            std::io::stdin().read_line(&mut temp).ok();
            let temp = temp.trim();
            temp.chars().collect::<Vec<_>>()
        })
        .collect::<Vec<_>>();

    let mut dp = vec![vec![vec![vec![0usize; w]; h]; w]; h];
    let mut frontier = HashSet::new();
    let middle = (h+w-2) / 2;
    if (h+w) % 2 == 0 {
        for i in 0..h.min(w) {
            if h > w {
                dp[middle-i][i][middle-i][i] = 1;
                frontier.insert((middle-i, i, middle-i, i));
            } else {
                dp[i][middle-i][i][middle-i] = 1;
                frontier.insert((i, middle-i, i, middle-i));
            }
        }
    } else {
        for i in 0..h.min(w) {
            if h > w {
                if grid[middle-i][i] == grid[middle-i+1][i] {
                    dp[middle-i][i][middle-i+1][i] += 1;
                    frontier.insert((middle-i, i, middle-i+1, i));
                }
                if i + 1 < w && grid[middle-i][i] == grid[middle-i][i+1] {
                    dp[middle-i][i][middle-i][i+1] += 1;
                    frontier.insert((middle-i, i, middle-i, i+1));
                }
            } else {
                if grid[i][middle-i] == grid[i][middle-i+1] {
                    dp[i][middle-i][i][middle-i+1] += 1;
                    frontier.insert((i, middle-i, i, middle-i+1));
                }
                if i + 1 < h && grid[i][middle-i] == grid[i+1][middle-i] {
                    dp[i][middle-i][i+1][middle-i] += 1;
                    frontier.insert((i, middle-i, i+1, middle-i));
                }
            }
        }
    }
    for _ in 0..(h+w-2)/2 {
        let mut next_frontier = HashSet::new();
        for &(sx, sy, gx, gy) in frontier.iter() {
            for sdir in 0..2 {
                let nsx = sx as isize + SDX[sdir];
                let nsy = sy as isize + SDY[sdir];
                if nsx >= 0 && nsy >= 0 {
                    let nsx = nsx as usize;
                    let nsy = nsy as usize;
                    for gdir in 0..2 {
                        let ngx = gx + EDX[gdir];
                        let ngy = gy + EDY[gdir];
                        if ngx < h && ngy < w {
                            if grid[nsx][nsy] == grid[ngx][ngy] {
                                next_frontier.insert((nsx, nsy, ngx, ngy));
                                dp[nsx][nsy][ngx][ngy] += dp[sx][sy][gx][gy];
                                dp[nsx][nsy][ngx][ngy] %= MOD;
                            }
                        }
                    }
                }
            }
        }
        frontier = next_frontier;
    }
    println!("{}", dp[0][0][h-1][w-1]);
}