// includes #include // macros #define ll long long int #define pb emplace_back #define mk make_pair #define pq priority_queue #define FOR(i, a, b) for(int i=(a);i<(b);++i) #define rep(i, n) FOR(i, 0, n) #define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--) #define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr) #define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr) #define vrep(v, i) for(int i = 0; i < (v).size(); i++) #define all(x) (x).begin(),(x).end() #define sz(x) ((int)(x).size()) #define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) #define FI first #define SE second #define dump(a, n) for(int i = 0; i < n; i++)cout << a[i] << "\n "[i + 1 != n]; #define dump2(a, n, m) for(int i = 0; i < n; i++)for(int j = 0; j < m; j++)cout << a[i][j] << "\n "[j + 1 != m]; #define bit(n) (1LL<<(n)) #define INT(n) int n; cin >> n; #define LL(n) ll n; cin >> n; #define DOUBLE(n) double n; cin >> n; using namespace std; template bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;} template bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;} template istream &operator>>(istream &is, vector &vec){for(auto &v: vec)is >> v; return is;} template ostream &operator<<(ostream &os, const vector& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;} template ostream &operator<<(ostream &os, const set& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template ostream &operator<<(ostream &os, const unordered_set& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template ostream &operator<<(ostream &os, const multiset& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template ostream &operator<<(ostream &os, const unordered_multiset& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template ostream &operator<<(ostream &os, const pair &p){os << p.first << " " << p.second; return os;} template ostream &operator<<(ostream &os, const map &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;} template ostream &operator<<(ostream &os, const unordered_map &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;} // types typedef pair P; typedef pair Pl; typedef pair Pll; typedef pair Pd; typedef complex cd; // constants const int inf = 1e9; const ll linf = 1LL << 50; const double EPS = 1e-10; const int mod = 201712111; const int dx[4] = {-1, 0, 1, 0}; const int dy[4] = {0, -1, 0, 1}; // solve int main(int argc, char const* argv[]) { ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20); INT(h); INT(w); vector st(h); cin >> st; vector s; if(w <= h){ s = st; }else{ s = vector(w); rep(i, w)rep(j, h)s[i][j] = st[j][i]; swap(h, w); } vector> dp(h, vector(w, 0)); rep(i, h)rep(j, w){ int c = (s[i][j] == '?'? 1: int(s[i][j] - '0')); if(i == 0 && j == 0)dp[i][j] = c; else{ dp[i][j] = inf; if(i - 1 >= 0)dp[i][j] = min(dp[i][j], dp[i-1][j] + c); if(j - 1 >= 0)dp[i][j] = min(dp[i][j], dp[i][j-1] + c); } } int T = dp[h-1][w-1]; cout << T << endl; vector v(bit(w), 0); v[1] = 1; rep(i, h)rep(j, w){ if(i == 0 && j == 0)continue; vector vn(bit(w), 0); int c = (s[i][j] == '?'? 0: int(s[i][j] - '0')); rep(k, sz(v)){ int stat = (k << 1) & (bit(w) - 1); if(c > 0){ bool ok = false; if(i > 0 && dp[i-1][j] + c == dp[i][j] && (k & bit(w-1)))ok = true; if(j > 0 && dp[i][j-1] + c == dp[i][j] && (k & 1))ok = true; if(ok)(vn[stat | 1] += v[k]) %= mod; else (vn[stat] += v[k]) %= mod; }else{ bool ok = false; if(i > 0 && dp[i-1][j] + 1 == dp[i][j] && (k & bit(w-1)))ok = true; if(j > 0 && dp[i][j-1] + 1 == dp[i][j] && (k & 1))ok = true; if(ok)(vn[stat | 1] += v[k]) %= mod; else (vn[stat] += v[k]) %= mod; (vn[stat] += 8 * v[k] % mod) %= mod; } } swap(vn, v); } ll res = 0; rep(i, bit(w))if(i & 1)res = (res + v[i]) % mod; cout << res << endl; return 0; }