#include #define pb push_back #define mp make_pair #define mt make_tuple #define ll long long #define pii pair #define tii tuple #define N 100005 #define mod 2000003 #define X first #define Y second #define eps 0.0000000001 #define all(x) x.begin(),x.end() #define tot(x) x+1,x+n+1 using namespace std; ll sol, a, b, i, p, x, n, zece, y, zero; void rec(ll b, ll zece, ll p, ll x) { if(b == 0) return; y = max(10 - (b / (zece / 10)) - 1, zero); sol -= y * (p/x); rec(b % (zece / 10), zece / 10, p / x, x); } int main() { cin.sync_with_stdio(0); cout.sync_with_stdio(0); cin >> a >> b; if(a >= 10) { cout << 0; return 0; } if(b <= 9) { cout << b - a; return 0; } sol = 10 - a; x = sol; b--; n = log10(b ) + 1; p = x * x; zece = 10; for(i = 2; i <= n; i++) { zece *= 10; sol += p; p *= x; } p/=x; rec(b, zece, p , x); cout << sol; return 0; }