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.snap.training;

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

public class RecycledNumbers {

	public static ArrayList<String> readFromFile()
	{
		ArrayList<String> inputList = new ArrayList<String>();
		try
		{
			FileReader fr = new FileReader("C:\\Users\\sanath\\Downloads\\code\\input.in");
			BufferedReader br = new BufferedReader(fr);
			String readLine = null;
			while((readLine=br.readLine())!=null)
			{
				inputList.add(readLine);
			}
		}
		catch (IOException e) {
			inputList = null;
			e.printStackTrace();
		}
		return inputList;
	}

	public static void writeToFile(ArrayList<String> outputList)
	{
		try
		{
			FileWriter fw = new FileWriter("C:\\Users\\sanath\\Downloads\\code\\output.out");
			BufferedWriter br = new BufferedWriter(fw);
			for(int i = 0; i < outputList.size(); i++)
			{
				br.write("Case #" + (i+1) + ": " + outputList.get(i));
				br.newLine();
			}
			br.close();
		}
		catch (IOException e) {
			e.printStackTrace();
		}
	}


	/**
	 * @param args
	 */
	public static void main(String[] args) {

		ArrayList<String> inputList = readFromFile();
		String inputStr = null;
		String finalStr = null;
		ArrayList<String> outputList = new ArrayList<String>();

		int noOfTestCases = Integer.parseInt(inputList.get(0).toString());
		int a, b, count = 0;
		for(int i = 1; i < noOfTestCases + 1; i++)
		{
			inputStr = inputList.get(i);
			finalStr = "";
			String[] splitStr = inputStr.split(" ");
			a = Integer.parseInt(splitStr[0]);
			b = Integer.parseInt(splitStr[1]);
			for(int j = a; j <= b; j++)
			{
				char[] tempChar = String.valueOf(j).toCharArray();
				char[] tempCharConverted = new char[tempChar.length];
				ArrayList<Integer> checkList = new ArrayList<Integer>();
				for(int k = 1; k < tempChar.length; k++)
				{
					for(int l = 0, x = k; l < tempChar.length; l++)
					{
						tempCharConverted[l] =  tempChar[x];
						x++;
						if(x == tempChar.length)
							x = 0;
					}
					if(tempCharConverted[0] != '0')
					{
						int value = Integer.parseInt(new String(tempCharConverted));
						if(value > j && value <= b && !checkList.contains(new Integer(value)))
						{
							checkList.add(new Integer(value));
							count++;
						}
					}
				}
			}
			finalStr = "" + count;
			count = 0;
			outputList.add(finalStr.trim());
		}

		writeToFile(outputList);

	}

}
