#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
#define int  long long
inline int read() {int res=0;char ch=getchar();while(!isdigit(ch)) ch=getchar();while(isdigit(ch)) res=(res<<3)+(res<<1)+(ch^48), ch=getchar();return res;
}
#define reg register
#define mod 1000000007
int l, r;int f[1005][10][10][2];
int wei[1005], cnt;inline int dp(int pos, int lst1, int lst2, bool hav, bool flag, bool fir, bool sec)
{                                                 //是否有限制 if (pos == 0) return hav;if (!fir and !sec and !flag and f[pos][lst1][lst2][hav] != -1) return f[pos][lst1][lst2][hav] % mod;int lim = flag ? wei[pos] : 9;int ans = 0;for (reg int i = 0 ; i <= lim ; i ++){if (i == lst1 and !fir) ans = (ans + dp(pos - 1, i, lst1, 1, flag && i == wei[pos], fir && i == 0, sec && lst1 == 0)) % mod;else if (i == lst2 and !fir and !sec) ans = (ans + dp(pos - 1, i, lst1, 1, flag && i == wei[pos], fir && i == 0, sec && lst1 == 0)) % mod;else ans = (ans + dp(pos-1, i, lst1, hav, flag && i == wei[pos], fir && i == 0, sec && lst1 == 0)) % mod;}if (!flag and !fir and !sec) f[pos][lst1][lst2][hav] = ans % mod;return ans % mod;
}signed main()
{memset(f, -1, sizeof f);int res1 = 0, res2 = 0;string a;cin >> a;cnt = 0;for (reg int i = a.length() - 1 ; i >= 0 ; i --) wei[++cnt] = a[i] - '0';int k = 1;if (wei[1]) wei[1]--;else {while(wei[k] == 0) wei[k] = 9, k++; wei[k]--;}res1 = dp(cnt, 0, 0, 0, 1, 1, 1) % mod;cnt = 0;cin >> a;for (reg int i = a.length() - 1 ; i >= 0 ; i --) wei[++cnt] = a[i] - '0';res2 = dp(cnt, 0, 0, 0, 1, 1, 1) % mod;printf("%lld\n", (res2 - res1 + mod) % mod);return 0;
}