#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7/*998244353*/;
const ll INF = 1LL << 60;
ll mod_pow(ll, ll, ll); ll mod_fact(ll, ll); ll mod_inv(ll, ll); ll gcd(ll, ll); ll lcm(ll, ll);
//
vector<ll> fun(string s){
    vector<vector<vector<ll>>> dp(s.size() + 1, vector<vector<ll>>(2, vector<ll>(2000)));
    dp[0][0][0] = 1;
    for(int i = 0; i < s.size(); i++){
        int d = s[i] - '0';
        for(int j = 0; j < 2; j++){
            for(int k = 0; k < 1900; k++){
                for(int n = 0; n <= (j ? 9 : d); n++){
                    dp[i + 1][j || (n < d)][k + n] = (dp[i + 1][j || (n < d)][k + n] + dp[i][j][k]) % MOD;
                }
            }
        }
    }
    /*for(int i = 0; i <= s.size(); i++){
        cout << "\n";
        for(int j = 0; j < 2; j++){
            cout << "\n";
            for(int k = 0; k < 60; k++){
                cout << dp[i][j][k] << " ";
            }
        }
    }*/
    vector<ll> ret(2000);
    for(int i = 0; i < 2000; i++){
        ret[i] = (dp[s.size()][0][i] + dp[s.size()][1][i]) % MOD;
    }
    return ret;
}
int main(){
    string s, t;
    cin >> s >> t;
    ll ans = 0;
    vector<ll> a = fun(s);
    vector<ll> b = fun(t);
    for(int i = 1; i < 2000; i++){
        ans = (ans + a[i] * b[i]) % MOD;
    }
    cout << ans << "\n";
}