package codejam;

import java.util.*;
import java.io.*;

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

import java.io.*;
import java.util.*;

public class C extends CodeJammer {

	public void process() throws IOException {
		long[] input = reader.readLongArray();
		long a = input[0];
		long b = input[1];
		int digits = 0;
		long a1 = a;
		while (a1>0) {
				  a1 /= 10;
				  digits++;
		}
		long total = 0;
		for (long x=a; x<=b; x++) {
			total += count(x,a,b, digits);
		}
		output(total);
	}

	public long count(long x, long a, long b, int d) {
		Set<Long> s = new HashSet<Long>();
		long y = x;
		for (int i=1; i<d; i++) {
			y = rotate(y,d);
			if (y>x && y>=a && y<=b) s.add(y);
  		}
		return s.size();		
	}

	public long rotate(long y, int d) {
		long digit = y%10;
		long rest = y/10;
		digit *= Math.pow(10,d-1);
		return digit + rest;
	}

	public static void main(String[] args) {
			  C c = new C();
			  c.run(args);
	}

}
