#include <bits/stdc++.h>
using namespace std;
int n , m , mod;
string s[2005];
int c[2005][2005];
int f[2005][2005];
int g[2005][2005];
int h[2005][2005];
int main() {
    cin >> n >> m >> mod ;
    for(int i = 1;i <= n;i++) {
        cin >> s[i]  ; s[i] = "$" + s[i] ;
    }
    c[1][1] = 1 ;f[1][1] = 0 ; g[1][1] = 1 ; h[1][1] = s[1][1] - '0';
    for(int i = 1;i <= n;i++) {
        for(int j = 1;j <= m;j++) {
            if(i == 1 && j == 1) continue ;
            c[i][j] = (c[i - 1][j] + c[i][j - 1]) % mod;
            f[i][j] = (f[i - 1][j] + f[i][j - 1]) % mod;
            g[i][j] = (g[i - 1][j] + g[i][j - 1]) % mod;
            h[i][j] = (h[i - 1][j] + h[i][j - 1]) % mod;
            if('0' <= s[i][j] && s[i][j] <= '9') {
                int x = s[i][j] - '0' ;
                h[i][j] = (10LL * h[i][j] + 1LL * g[i][j] * x) %mod;
            }
            else if(s[i][j] == '*') {
                g[i][j] = h[i][j] ;
                h[i][j] = 0;
            }
            else {
                f[i][j] = (f[i][j] + h[i][j]) % mod;
                h[i][j] = 0; g[i][j] = c[i][j];
            }
            // printf("%d %d : %d %d %d %d\n",i,j,f[i][j],g[i][j],h[i][j],c[i][j]) ;
        }
    }
    int ans = (f[n][m] + h[n][m]) % mod;
    cout << ans << '\n' ; return 0;
}