import sys
readline=sys.stdin.readline

H,W=map(int,readline().split())
A=[list(readline().rstrip()) for h in range(H)]
if H<W:
    A=[[A[h][w] for h in range(H)] for w in range(W)]
    H,W=W,H
inf=1<<30
dist=[[inf]*W for h in range(H)]
dist[0][0]=int(A[0][0])
for h in range(H):
    for w in range(W):
        if A[h][w]=="?":
            d=1
        else:
            d=int(A[h][w])
        if h:
            dist[h][w]=min(dist[h][w],dist[h-1][w]+d)
        if w:
            dist[h][w]=min(dist[h][w],dist[h][w-1]+d)
B=[[0]*W for h in range(H)]
B[H-1][W-1]=1
for h in range(H-1,-1,-1):
    for w in range(W-1,-1,-1):
        if B[h][w]:
            if A[h][w]=="?":
                d=1
            else:
                d=int(A[h][w])
            if h and dist[h-1][w]+d==dist[h][w]:
                B[h-1][w]=1
            if w and dist[h][w-1]+d==dist[h][w]:
                B[h][w-1]=1
for h in range(H):
    for w in range(W):
        if B[h][w]:
            if A[h][w]=="?":
                B[h][w]=2
            else:
                A[h][w]=int(A[h][w])
mod=201712111
dp=[0]*(1<<W)
for w in range(1,W+1):
    if all(B[0][ww] for ww in range(w)):
        if w==W or B[0][w]==0:
            dp[(1<<w)-1]=pow(9,A[0][w:].count("?"),mod)
        elif B[0][w]==2:
            dp[(1<<w)-1]=pow(9,A[0][w+1:].count("?"),mod)*8%mod
for hw in range(W+1,H*W+1):
    h,w=divmod(hw-1,W)
    prev=dp
    dp=[0]*(1<<W)
    for bit in range(1<<W):
        if B[h][w]==1:
            if w and bit&1<<W-1 and dist[h][w-1]+A[h][w]==dist[h][w] or bit&1 and dist[h-1][w]+A[h][w]==dist[h][w]:
                dp[bit>>1|1<<W-1]+=prev[bit]
            else:
                dp[bit>>1]+=prev[bit]
        elif B[h][w]==2:
            if w and bit&1<<W-1 and dist[h][w-1]+1==dist[h][w] or bit&1 and dist[h-1][w]+1==dist[h][w]:
                dp[bit>>1|1<<W-1]+=prev[bit]
                dp[bit>>1]+=8*prev[bit]
            else:
                dp[bit>>1]+=9*prev[bit]
        else:
            if A[h][w]=="?":
                dp[bit>>1]+=prev[bit]*9
            else:
                dp[bit>>1]+=prev[bit]
    for bit in range(1<<W):
        dp[bit]%=mod
ans=sum(dp[bit] for bit in range(1<<W) if bit&1<<W-1)%mod
print(dist[H-1][W-1])
print(ans)