#include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>

using namespace std;

#define LOG(...) printf(__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };

struct UnionFind {
	vector<int> v;
	UnionFind(int n) : v(n) { for (int i = 0; i < n; i++) v[i] = i; }
	int  find(int x) { return v[x] == x ? x : v[x] = find(v[x]); }
	void unite(int x, int y) { v[find(x)] = find(y); }
};
bool thr(string s,int num, int idx) {
	if (idx != 0) {
		if (s[idx] == '?' || s[idx] == num + '0') {
			return true;
		}
	}
	else {
		if ((s[idx] == '?'&&num!=0) || s[idx] == num + '0') {
			return true;
		}
	}
	return false;
}
int main() {
	string s1, s2, s3;
	while (cin >> s1, s1 != "0") {
		cin >> s2 >> s3;
		long long nc = 1;
		long long yc = 0;
		REP(i, s1.length()) {
			int keta = s1.length() - 1 - i;
			long long ncnt = 0;
			long long ycnt = 0;
			REP(j, 10) {
				if (thr(s1,j,keta))
					REP(k, 10) {
					if (thr(s2, k, keta))
						REP(l, 10) {
						if (thr(s3, l, keta)) {
							if ((j + k) % 10 == l)
								if (j + k < 10)
									ncnt += nc;
								else
									ycnt += nc;
							if ((j + k+1) % 10 == l)
								if (j + k+1 < 10)
									ncnt += yc;
								else
									ycnt += yc;
							ncnt %= 1000000007;
							ycnt %= 1000000007;
						}
					}
				}
			}
			nc = ncnt;
			yc = ycnt;
		}
		cout << nc << endl;
	}
}