import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfCopyOfMain {

	static int ndigits(int n) {
		return (int) (Math.log10(n) + 1);
	}

	static int rot(int n, int dig) {
		return (int) ((n % 10) * Math.pow(10, dig - 1)) + (int) (n / 10);
	}

	public static void main(String[] args) throws FileNotFoundException {
		String file = "C-large";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for (int t = 1; t <= T; t++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int c = 0;
			int[] list = new int[ndigits(B)];
			numbers: for (int i = A; i <= B; i++) {
				int digs = ndigits(i);
				int rot = i;
				int pairs = 0;

				Arrays.fill(list, -1);
				list[0] = i;

				digits: for (int j = 1; j <= digs + 1; j++) {

					rot = rot(rot, digs);
					if(rot < i)
						continue;

					if (A <= rot && rot <= B) {
						for (int k = 0; k < j; k++) {
							if (list[k] == rot) {
								continue digits;
							}
						}
						pairs++;
						list[j] = rot;
					}
				}

				//c += pairs * (pairs + 1) / 2;
				c += pairs ;
				// c+=digs;
			}
			out.println("Case #" + t + ": " + c);
		}

		in.close();
		out.close();
	}
}

package qualifier;

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class TC {
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		try {
			File file = new File("src/qualifier/C-large.in");
			String a = file.getAbsolutePath();
			in = new Scanner(file);
			out = new PrintWriter(new File("src/qualifier/C-large.out"));
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		
		TC worker = new TC();
		int n = in.nextInt();
		
		for (int i=1; i<=n; i++) {
			out.println("Case #" + i + ": " + worker.nums(in.nextInt(), in.nextInt(), out));
		}
		out.flush();
	}
	
	public int nums(int a,int b, PrintWriter out) {
		int sum = 0;
		int i = a;
		int order = 0;
		while (i>0) {
			i=i/10;
			order++;
		}
			
		for (i=a; i<b; i++) {
			Set<Integer> s = new HashSet<Integer>();
			for (int j=1; j<order; j++) {
				int n1 = 1;
				int n2 = 1;
				for (int k=1; k<=j; k++)
					n1 *= 10;
				for (int k=1; k<=order-j; k++)
					n2 *= 10;
				
				int k1 = i/n1;
				int k2 = i%n1;
				int tr = k2 * n2 + k1;
				if (tr>i && tr<=b && !s.contains(tr)) {
					sum++;
					s.add(tr);
				}
			}
		}
		
		return sum;
	}

}
