#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx")
// #pragma comment(linker, "/stack:200000000"]

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <bitset>
#include <stack>
#include <random>
#include <fstream>
#include <sstream>
#include <chrono>

#define fi first
#define se second
#define pb push_back
#define ll long long
#define ld long double
#define hm unordered_map
#define pii pair<int, int>
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define cinv(v) for (auto& x: v) cin >> x
#define fr(i, n) for (int i = 0; i < n; ++i)
#define fl(i, l, n) for (int i = l; i < n; ++i)

#define int ll

using namespace std;

#ifdef __LOCAL
	#define dbg(x) cerr << #x << " : " << x << '\n'
	const int maxn = 20;
#else
	#define dbg(x)
	const int maxn = 5e4 + 20;
#endif

//tg: @galebickosikasa

ostream& operator << (ostream& out, vector<int>& v) {
	for (auto& x: v) out << x << ' ';
	return out;
}

ostream& operator << (ostream& out, pii& v) {
	out << v.fi << ", " << v.se;
	return out;
}

istream& operator >> (istream& in, pii& a) {
	in >> a.fi >> a.se;
	return in;
}

const ll inf = (ll) 2e9;
const ld pi = asin (1) * 2;
const ld eps = 1e-8;
const ll mod = (ll)1e9 + 7;
const ll ns = 97;

mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

ll mult (ll a, ll b) {
	return a * b % mod;
}

ll add (ll a, ll b) {
	int c = a + b;
	if (c >= mod) c -= mod;
	return c;
}

ll powmod (ll a, ll n) {
	if (n == 0) return 1;
	if (n % 2) return mult (a, powmod (a, n - 1));
	ll b = powmod (a, n / 2);
	return mult (b, b);
}

ll inv (int a) {
	return powmod (a, mod - 2);
}

int cnt1[maxn][10], cnt2[maxn][10], dp[maxn][10];

signed main () {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	string a, b;
	cin >> a >> b;
	if (a == b) {
		cout << 0 << '\n';
		exit (0);
	}
	reverse (all (a));
	int t = 0;
	reverse (all (b));
	int j = sz (a) - 1;
	while (j >= 0 && a[j] == b[j]) --j;
	int sum = 0;
	for (int i = sz (a) - 1; i >= 0; --i) {
		sum = (sum * 10 + a[i] - '0') % mod;
	}
	++sum;
	fl (i, 1, sz (a)) {
		int x = a[i] - '0';
		t = add (t, powmod (10, i - 1) * x % mod);
	}

	fr (i, 10) cnt1[0][i] = t;
	int s = a[0] - '0';
	fr (i, s + 1) ++cnt1[0][i];
	fl (i, 1, sz (a)) {
		s = a[i] - '0';
		t -= powmod (10, i - 1) * s;
		if (t < 0) t += mod;
		fr (k, 10) cnt1[i][k] = t;
		fr (k, s + 1) cnt1[i][k] = add (cnt1[i][k], powmod (10, i));
	}

	int r = 0;
	for (auto& x: cnt1[sz (a) - 1]) r += x;
	r -= cnt1[sz (a) - 1][s];
	cnt1[sz (a) - 1][s] = sum - r;
	if (cnt1[sz (a) - 1][s] < 0) cnt1[sz (a) - 1][s] += mod;
	fl (i, sz (a), sz (b)) cnt1[i][0] = sum;

	sum = 0;
	t = 0;
	for (int i = sz (b) - 1; i >= 0; i--) {
		sum = (sum * 10 + b[i] - '0') % mod;
	}
	++sum;
	fl (i, 1, sz (b)) {
		int x = b[i] - '0';
		t = add (t, powmod (10, i - 1) * x % mod);
	}
	fr (i, 10) cnt2[0][i] = t;
	s = b[0] - '0';
	fr (i, s + 1) ++cnt2[0][i];
	fl (i, 1, sz (b)) {
		s = b[i] - '0';
		t -= powmod (10, i - 1) * s;
		if (t < 0) t += mod;
		fr (k, 10) cnt2[i][k] = t;
		fr (k, s + 1) cnt2[i][k] = add (cnt2[i][k], powmod (10, i));
	}
	r = 0;
	for (auto& x: cnt2[sz (b) - 1]) r += x;
	r -= cnt2[sz (b) - 1][s];
	cnt2[sz (b) - 1][s] = sum - r;
	if (cnt2[sz (b) - 1][s] < 0) cnt2[sz (b) - 1][s] += mod;

	s = a[0] - '0';
	--cnt1[sz (a) - 1][s];
	++cnt1[0][0];
	for (auto& x: cnt1) --x[0];
	fr (i, sz (b)) {
		fr (k, 10) {
			dbg (i);
			dbg (k);
			dbg (cnt1[i][k]);
			dbg (cnt2[i][k]);
			dp[i][k] = cnt2[i][k] - cnt1[i][k];
			dbg (dp[i][k]);
		}
	}
	int ans = 0;
	fr (i, sz (b)) {
		fr (ii, 10) {
			fl (jj, ii + 1, 10) {
				ans = add (ans, (jj - ii) * dp[i][ii] * dp[i][jj] % mod);
			}
		}
	}
	cout << ans * 2 % mod << '\n';








}