#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 cnt[maxn][10];

signed main () {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	string a, b;
	cin >> a >> b;
	reverse (all (a));
	while (sz (a) < sz (b)) a.pb ('0');
	reverse (all (a));
	int j = 0;
	while (j < sz (a) && a[j] == b[j]) ++j;
	if (j == sz (a)) {
		cout << 0 << '\n';
		exit (0);
	}
	int s = a[j] - '0', t = b[j] - '0';
	for (int i = s; i <= t; ++i) cnt[j][i] = 1;
	for (int i = j + 1; i < sz (a); ++i) {
		int sum = 0;
		fr (k, 10) sum += cnt[i - 1][k];
		--sum;
		s = a[i] - '0', t = b[i] - '0';
		fl (z, s, 10) cnt[i][z] += 1;
		--sum;
		fr (z, 10) cnt[i][z] += sum;
		fr (z, t + 1) ++cnt[i][z];
		for (auto& x: cnt[i]) x %= mod;
	}
	// cnt[0][0] = 9;
	// if (a[0] == '0') {
	// 	int gay = 0;
	// 	fr (k, sz (a)) {
	// 		gay = mult (gay, 10);
	// 		gay = add (gay, a[k] - '0');
	// 	}
	// 	dbg (gay);
	// 	while (a[j] == '0') {
	// 		if (j == 0) cnt[j][0] = powmod (10, sz (a) - j - 1) - gay;
	// 		else cnt[j][0] += powmod (10, sz (a) - j - 1) - gay;
	// 		cnt[j][0] %= mod;
	// 		++j;
	// 	}
	// 	j = 0;
	// }

	int ans = 0;
	fl (k, j, sz (a)) {
		fr (i, 10) {
			dbg (k);
			dbg (i);
			dbg (cnt[k][i]);
			fl (j, i + 1, 10) {
				ans += (j - i) * cnt[k][i] * cnt[k][j] % mod;
				if (ans >= mod) ans -= mod;
			}
		}
	}
	cout << ans * 2 % mod << '\n';








}