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 com.mohit.codejam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;

public class RecycledNumbers {

	public static void main(String[] args) {
		try {
			int noOfTests = 0;
			FileInputStream fis = new FileInputStream("C-large.txt");
			DataInputStream din = new DataInputStream(fis);
			BufferedReader br = new BufferedReader(new InputStreamReader(din));

			FileWriter fstream = new FileWriter("output_large.txt");
			BufferedWriter out = new BufferedWriter(fstream);

			String strLine;
			strLine = br.readLine();
			if (strLine == null || strLine == "")
				return;

			strLine = strLine.trim();
			noOfTests = Integer.parseInt(strLine);

			int testNumber = 1;
			while (noOfTests > 0) {
				strLine = br.readLine();
				if (strLine == null || strLine == "" || strLine == "\n")
					break;
				strLine = strLine.trim().toLowerCase();
				String[] nums = strLine.split(" ");
				int A = Integer.parseInt(nums[0].trim());
				int B = Integer.parseInt(nums[1].trim());
				int firstCharB = Integer.parseInt(String.valueOf(B).charAt(0) +"");
				int recycledNum = 0;
				for (int i = A; i <= B; i++) {

					String n = String.valueOf(i);
					if (Integer.parseInt(n.substring(n.length() - 1)) > firstCharB) {
						int check = i;
						while(check>0)
						{
							int nexti = check % 10;
							if(nexti < firstCharB)
								break;
							else
								check = check/10;
						}
						if(check == 0)
						{
							i = i + (10 - i%10);
							continue;
						}
					}
					{
						int condition = 0;
						if (n.length() % 2 == 0
								&& n.substring(0, n.length() / 2).equals(
										n.substring(n.length() / 2))) {
							condition = n.length() / 2;
						} else {
							condition = n.length();
						}
							for (int j = 1; j < condition; j++) {
								String m = n.substring(j) + n.substring(0, j);
								int mi = Integer.parseInt(m);
								if (mi <= i || mi > B)
									continue;
								recycledNum++;
							}
						}
				}
				 out.write("Case #" + testNumber + ": " + recycledNum + "\n");
				 testNumber ++;
			}
			br.close();
			out.close();
		} catch (Exception e) {
			System.out.print(e.getMessage());
		}
	}

}
