import std.conv, std.functional, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } void main() { try { for (; ; ) { const A = readLong(); const B = readLong(); long ans; // [12 10^k, 13 10^k) mod 10^(k+2) foreach (k; 0 .. 13) { long tmp; tmp += B / 10L^^(k + 2) * 10L^^k + min(max(B % 10L^^(k + 2) - 12 * 10L^^k + 1, 0), 10L^^k); tmp -= (A - 1) / 10L^^(k + 2) * 10L^^k + min(max((A - 1) % 10L^^(k + 2) - 12 * 10L^^k + 1, 0), 10L^^k); ans += tmp; } // 1 and 2 if (A <= 1 && 2 <= B) { ans += 1; } // [2 10^(k+1) + 2, 3 10^(k+1) + 2), 2 mod 10 foreach (k; 0 .. 13) { long tmp; if (B >= 2) { tmp += min(max((B - 2) / 10 - 2 * 10L^^k + 1, 0), 10L^^k); } if (A >= 2) { tmp -= min(max((A - 2) / 10 - 2 * 10L^^k + 1, 0), 10L^^k); } ans += tmp; } writeln(ans); } } catch (EOFException e) { } }