
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
#include<deque>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll)INF*INF
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(int i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef vector<pii> vp;
typedef deque<int> di;

int gcd(int a, int b){
    if(b==0) return a;
    return gcd(b,a%b);
}
int lcm(int a, int b){
    return a*b/gcd(a,b);
}

signed main(void) {
    int i,j;
    string a,b,c;
    while(cin >> a, a != "0"){
        cin >> b;
        cin >> c;
        reverse(all(a));
        reverse(all(b));
        reverse(all(c));
        int n = a.size();
        vector<vi> dp(n+1,vi(2,0));
        dp[0][0]++;
        rep(i,n)rep(j,2)if(dp[i][j]){
            rep(x,10)rep(y,10){
                if(i == n-1 && (!x || !y))continue;
                if(a[i] != '?' && a[i] - '0' != x)continue;
                if(b[i] != '?' && b[i] - '0' != y)continue;
                if(c[i] != '?' && c[i] - '0' != (x + y + j)%10)continue;
                (dp[i+1][(x+y+j)/10] += dp[i][j]) %= MOD;
            }
        }

        cout << dp[n][0] << endl;
    }
}

