#include <bits/stdc++.h>
using namespace std;
using lint = long long;
template<class T = int> using V = vector<T>;
template<class T = int> using VV = V< V<T> >;

struct Mint {
  using M = Mint;
  static unsigned P;
  unsigned v;
  constexpr Mint() : v(0) {}
  constexpr Mint(auto x) : v(x >= 0 ? x % P : (P - -x % P) % P) {}
  constexpr Mint(unsigned v, int) : v(v) {}
  static unsigned p() { return P; }
  M operator+() const { return *this; }
  M operator-() const { return {v ? P - v : 0, 0}; }
  explicit operator bool() const noexcept { return v; }
  bool operator!() const noexcept { return !(bool)*this; }
  M operator*(M r) const { return M(*this) *= r; }
  M operator/(M r) const { return M(*this) /= r; }
  M operator+(M r) const { return M(*this) += r; }
  M operator-(M r) const { return M(*this) -= r; }
  bool operator==(M r) const { return v == r.v; }
  bool operator!=(M r) const { return !(*this == r); }
  M& operator*=(M r) { v = (uint64_t)v * r.v % P; return *this; }
  M& operator/=(M r) { return *this *= r.inv(); }
  M& operator+=(M r) { if ((v += r.v) >= P) v -= P; return *this; }
  M& operator-=(M r) { if ((v += P - r.v) >= P) v -= P; return *this; }
  M inv() const {
    int a = v, b = P, x = 1, u = 0;
    while (b) {
      int q = a / b;
      swap(a -= q * b, b);
      swap(x -= q * u, u);
    }
    assert(a == 1);
    return x;
  }
  M pow(auto n) const {
    if (n < 0) return pow(-n).inv();
    M res = 1;
    for (M a = *this; n; a *= a, n >>= 1) if (n & 1) res *= a;
    return res;
  }
  friend M operator*(auto l, M r) { return M(l) *= r; }
  friend M operator/(auto l, M r) { return M(l) /= r; }
  friend M operator+(auto l, M r) { return M(l) += r; }
  friend M operator-(auto l, M r) { return M(l) -= r; }
  friend ostream& operator<<(ostream& os, M r) { return os << r.v; }
  friend istream& operator>>(istream& is, M& r) { lint x; is >> x; r = x; return is; }
  friend bool operator==(auto l, M r) { return M(l) == r; }
  friend bool operator!=(auto l, M r) { return !(l == r); }
};
unsigned Mint::P;

int main() {
  cin.tie(nullptr); ios::sync_with_stdio(false);
  int h, w; cin >> h >> w >> Mint::P;
  VV<Mint> sx(h, V<Mint>(w));
  VV<Mint> sy(h, V<Mint>(w, 1));
  VV<Mint> yz(h, V<Mint>(w));
  VV<Mint> comb(h, V<Mint>(w, 1));
  for (int i = 0; i < h; ++i) for (int j = 0; j < w; ++j) {
    char c; cin >> c;
    if (!i and !j) {
      yz[i][j] = c - '0';
      continue;
    }
    if (i and j) {
      comb[i][j] = comb[i - 1][j] + comb[i][j - 1];
    }
    if (c == '+') {
      if (i) {
        sx[i][j] += sx[i - 1][j] + yz[i - 1][j];
      }
      if (j) {
        sx[i][j] += sx[i][j - 1] + yz[i][j - 1];
      }
      sy[i][j] = comb[i][j];
    } else if (c == '*') {
      sy[i][j] = 0;
      if (i) {
        sx[i][j] += sx[i - 1][j];
        sy[i][j] += yz[i - 1][j];
      }
      if (j) {
        sx[i][j] += sx[i][j - 1];
        sy[i][j] += yz[i][j - 1];
      }
    } else {
      sy[i][j] = 0;
      if (i) {
        sx[i][j] += sx[i - 1][j];
        sy[i][j] += sy[i - 1][j];
        yz[i][j] += 10 * yz[i - 1][j] + sy[i - 1][j] * (c - '0');
      }
      if (j) {
        sx[i][j] += sx[i][j - 1];
        sy[i][j] += sy[i][j - 1];
        yz[i][j] += 10 * yz[i][j - 1] + sy[i][j - 1] * (c - '0');
      }
    }
  }
  cout << sx.back().back() + yz.back().back() << '\n';
}


Measured memory_bytes: 62376