Baekjoon #1520

#include<bits/stdc++.h>

using namespace std;

int N, M;
int maps[501][501];
int dp[501][501];

int dfs(int n, int m, int val) {

    if (n == N && m == M) return 1;
    if (dp[n][m] != -1) return dp[n][m];

    dp[n][m] = 0;

    if (n + 1 <= N && val > maps[n + 1][m]) dp[n][m] += dfs(n + 1, m, maps[n + 1][m]);
    if (n - 1 >= 1 && val > maps[n - 1][m]) dp[n][m] += dfs(n - 1, m, maps[n - 1][m]);
    if (m + 1 <= M && val > maps[n][m + 1]) dp[n][m] += dfs(n, m + 1, maps[n][m + 1]);
    if (m - 1 >= 1 && val > maps[n][m - 1]) dp[n][m] += dfs(n, m - 1, maps[n][m - 1]);

    return dp[n][m];
}

int main() {
    ios::sync_with_stdio(false); 
    cin.tie(NULL);

    cin >> N >> M;
    for (int i = 1; i <= N; i++) {
        for (int j = 1; j <= M; j++) {
            cin >> maps[i][j];
        }
    }

    memset(dp, -1, sizeof(dp));

    cout << dfs(1, 1, maps[1][1]) << '\n';

    return 0;
}

import sys

def input():
    return sys.stdin.readline().rstrip()

def DFS(x,y):
    if x == N-1 and y == M-1:
        return 1
    if dp[x][y] == -1:
        dp[x][y] = 0
        for i in range(4):
            dx = nx[i] + x
            dy = ny[i] + y
            if dx < 0 or dx >= N or dy < 0 or dy >= M:
                continue
            if arr[dx][dy] < arr[x][y]:
                dp[x][y] += DFS(dx,dy)
    return dp[x][y]

N, M = map(int, input().split())
arr = []
nx = [-1, 0, 1, 0]
ny = [0, -1, 0, 1]
dp = [[-1 for i in range(M)] for j in range(N)]
for i in range(N):
    arr.append(list(map(int, input().split())))
print(DFS(0,0))