#include<cstdio>

 #include<cstring>

 #include<cmath>

 #define F(i,a,b) for(int i=a;i<=b;i++)

 typedef long long LL;

 char ops[],a[],b[];

 int dig[],st,len,oplen;

 LL N=(LL)1e10,dp[][][];

 int check(int pre,int now,int idx){

     char c=ops[idx];

     if(c=='/')return pre<now;

     else if(c=='-')return pre==now;

     return pre>now;

 }

 LL dfs(int pos,int idx=,int pre=,int z=,bool inf=){

     if(!pos)return idx==oplen;

     if(!inf&&~dp[pos][pre][idx])return dp[pos][pre][idx];

     int end=inf?dig[pos]:;LL ans=;

     F(i,,end){

         if(!z)ans+=dfs(pos-,idx,i,z||i,inf&&i==end),ans%=N;

         else if(idx<oplen&&check(pre,i,idx))

             ans+=dfs(pos-,idx+,i,z||i,inf&&i==end),ans%=N;

         else if(idx>&&check(pre,i,idx-))

             ans+=dfs(pos-,idx,i,z||i,inf&&i==end),ans%=N;

     }

     if(!inf)dp[pos][pre][idx]=ans;

     return ans;

 }

 void f_ck(){

     memset(dp,-,sizeof(dp));

     oplen=strlen(ops);

     for(st=,len=;a[st]=='';)st++;

     int end=strlen(a);

     for(int i=end-;i>=st;i--)dig[++len]=a[i]-'';

     dig[]--;//处理左区间-1

     for(int i=;dig[i]<;)dig[i]=,dig[i+]--;

     LL tmp=(len==)?:dfs(len);

     for(st=,len=;b[st]=='';)st++;

     end=strlen(b);

     for(int i=end-;i>=st;i--)dig[++len]=b[i]-'';

     LL an=dfs(len)-tmp+N;

     printf("%08lld\n",an%(LL)1e8);

 }

 int main(){

     while(~scanf("%s%s%s",ops,a,b))f_ck();

     return ;

 }