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();
	}
}

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;


public class Recycled {

	private static String in;
	private static String[] ins;
	private static BufferedReader buf;
	private static int cases;
	private static File arquivo = new File("output.txt");
	private static FileOutputStream fos;
	
	public static void main(String[] args) {
	
		buf = new BufferedReader(new InputStreamReader(System.in));
		try {
			fos = new FileOutputStream(arquivo);
		} catch (FileNotFoundException e1) {
			e1.printStackTrace();
			System.exit(0);
		}
		
		try {
			in = buf.readLine();
			cases = Integer.parseInt(in);
		} catch (IOException e) {
			e.printStackTrace();
			System.exit(0);
		}
		
		for (int i = 1; i <= cases; i++) {
			int result = 0;
			try {
				in = buf.readLine();
				ins = in.split(" ");
			} catch (IOException e) {
				e.printStackTrace();
				System.exit(0);
			}
			
			int A = Integer.parseInt(ins[0]);
			int B = Integer.parseInt(ins[1]);
			
			for (int numb = A; numb <= B; numb++) {
				result += reciclar(numb, A, B);
			}
			
			try {
				String res = "Case #" + i + ": " + result + System.getProperty("line.separator");
				fos.write(res.getBytes());
			} catch (IOException e) {
				e.printStackTrace();
				System.exit(0);
			}
		}

	}
	
	
	
	public static int reciclar(int numb, int A, int B) {
		int result = 0;
		ArrayList<Integer> usados = new ArrayList<Integer>();
		char[] numbvec = String.valueOf(numb).toCharArray();
		
		
		for (int i = 1; i < numbvec.length; i++) {
			String rot = new String();
			for (int j = i; j < numbvec.length + i; j++) {
				if (j >= numbvec.length) {
					rot += numbvec[j-numbvec.length];
				}
				else {
					rot += numbvec[j];
				}
			}
			int numbrot = Integer.parseInt(rot);
			
			
			if (numbrot >= A && numbrot <= B && numb != numbrot && !usados.contains(numbrot)) {
				if (numb < numbrot){
					result++;
					usados.add(numbrot);
				}
			}
		}

		return result;
	}

}
