#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
#include<list>
#include<bitset>
#include<stack>
#include<memory>
using namespace std;
using namespace std::chrono;
typedef long long int llint;
typedef double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
/*cout<<fixed<<setprecision(20);cin.tie(0);ios::sync_with_stdio(false);*/
const llint mod=1000000007;
const llint big=2.19e18+1;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-15;
template <class T,class U>bool mineq(T& a,U b){if(a>b){a=b;return true;}return false;}
template <class T,class U>bool maxeq(T& a,U b){if(a<b){a=b;return true;}return false;}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
llint lcm(llint a,llint b){if(a==0){return b;}return a/gcd(a,b)*b;}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
template<class T>llint LBI(vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}
template<class T>llint UBI(vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}
bool solve(void){
	string S,T,U;
	cin>>S;if(S=="0"){return false;}
	cin>>T>>U;
	REV(S);REV(T);REV(U);
	//繰り上がりは0か1か
	llint dp=1,ep=0;
	for(int i=0;i<S.size();i++){
		llint ddp=0,eep=0;
		for(int x=0;x<10;x++){
			if(S[i]!='?'&&S[i]-'0'!=x){continue;}
			if(i+1==S.size()&&x==0){continue;}
			for(int y=0;y<10;y++){
				if(T[i]!='?'&&T[i]-'0'!=y){continue;}
				if(i+1==T.size()&&y==0){continue;}
				int ds=(x+y)%10;
				if(U[i]=='?'||U[i]-'0'==ds){
					if(x+y>=10){eep+=dp;}
					else{ddp+=dp;}
				}
				int es=(x+y+1)%10;
				if(U[i]=='?'||U[i]-'0'==es){
					if(x+y+1>=10){eep+=ep;}
					else{ddp+=ep;}
				}
			}
		}
		dp=ddp%mod;
		ep=eep%mod;
		//cerr<<dp<<" "<<ep<<endl;
	}
	cout<<dp<<endl;
	return true;
}

int main(void){
	while(solve()){}
	return 0;
}
