#include <bits/stdc++.h>

using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()

template<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }

template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type
fill_v(T &t, const V &v) { t=v; }
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); }

template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a) {
    out<<'('<<a.first<<','<<a.second<<')'; return out;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
    out<<'[';
    for(const T &i: a) out<<i<<',';
    out<<']';
    return out;
}
template<class T>
ostream &operator <<(ostream& out, const set<T>& a) {
    out<<'{';
    for(const T &i: a) out<<i<<',';
    out<<'}';
    return out;
}
template<class T, class S>
ostream &operator <<(ostream& out, const map<T,S>& a) {
    out<<'{';
    for(auto &i: a) out<<i<<',';
    out<<'}';
    return out;
}

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL
const int INF = 1<<30;
const ll LLINF = 1LL<<60;

signed main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    ll h, w, m;
    cin >> h >> w >> m;
    vector<string> s(h);
    REP(i, h) cin >> s[i];

    vector<vector<ll>> c(h+w, vector<ll>(h+w));
    REP(i, h+w) {
        c[i][0] = c[i][i] = 1;
        FOR(j, 1, i) c[i][j] = (c[i-1][j] + c[i-1][j-1]) % m;
    }

    vector<vector<ll>> a(h, vector<ll>(w)), b(h, vector<ll>(w)), d(h, vector<ll>(w));
    b[0][0] = 1;
    d[0][0] = s[0][0]-'0';
    REP(i, h) REP(j, w) {
        if(s[i][j]=='+') {
            if(i) (a[i][j] += a[i-1][j]+d[i-1][j]) %= m;
            if(j) (a[i][j] += a[i][j-1]+d[i][j-1]) %= m;
            b[i][j] = c[i+j][i];
            d[i][j] = 0;
        } else if(s[i][j]=='*') {
            if(i) {
                (a[i][j] += a[i-1][j]) %= m;
                (b[i][j] += d[i-1][j]) %= m;
            }
            if(j) {
                (a[i][j] += a[i][j-1]) %= m;
                (b[i][j] += d[i][j-1]) %= m;
            }
            d[i][j] = 0;
        } else {
            const ll t = s[i][j]-'0';
            if(i) {
                (a[i][j] += a[i-1][j]) %= m;
                (b[i][j] += b[i-1][j]) %= m;
                (d[i][j] += 10*d[i-1][j]+t*b[i-1][j]) %= m;
            }
            if(j) {
                (a[i][j] += a[i][j-1]) %= m;
                (b[i][j] += b[i][j-1]) %= m;
                (d[i][j] += 10*d[i][j-1]+t*b[i][j-1]) %= m;
            }
        }
    }
     
    // cout << "a:" << endl;
    // REP(i, h) cout << a[i] << endl;
    // cout << "b:" << endl;
    // REP(i, h) cout << b[i] << endl;
    // cout << "d:" << endl;
    // REP(i, h) cout << d[i] << endl;

    cout << (a[h-1][w-1] + d[h-1][w-1]) % m << endl;

    return 0;
}



Measured memory_bytes: 215060