
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;
import java.io.File;
import java.io.IOException;
import java.io.FileWriter;
import java.io.BufferedWriter;

public class Recycle
{
	public static void main(String[] args)
	{
/*		Set<Integer> perms = getPermutations(123456);
		
		for(Integer i: perms)
			System.out.println(i);*/
	
		try
		{
			Scanner s = new Scanner(new File("recycle.in"));
			BufferedWriter w = new BufferedWriter(new FileWriter(new File("recycle.out")));
			int numCases = s.nextInt();
			s.nextLine();
			
			for(int n = 1;n <= numCases; n++)
			{
				int A = s.nextInt();
				int B = s.nextInt();
				int count = 0;
				for(int k = A; k <= B; k++)
				{
					count += getNumPairs(k, B);
				}
				
				w.write("Case #" + n + ": " + count + "\n");
			}
			
			w.flush();
			w.close();
		}
		catch (IOException e)
		{
			e.printStackTrace();
		}
	}
	
	public static int getNumPairs(int n, int B)
	{
		Set<Integer> possibles = getPermutations(n);
		int count = 0;
		for(Integer i : possibles)
			if(i > n && i <= B)
				count++;
		return count;
	}
	
	public static Set<Integer> getPermutations(int n)
	{
		Set<Integer> perms = new TreeSet<Integer>();
		char[] digits = String.valueOf(n).toCharArray();
		
		for(int firstPos = 1; firstPos < digits.length; firstPos++)
		{
			String toBuild = "";
			for(int k = 0; k < digits.length; k++)
				toBuild += digits[(firstPos + k) % digits.length];
			perms.add(Integer.parseInt(toBuild));
		}
		return perms;
	}
	

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

class ProblemC
{
	public static void main(String[] args) 
	{
		try{
			// Open the file that is the first 
			// command line parameter
			FileInputStream fstream = new FileInputStream("input.txt");
			BufferedWriter out = new BufferedWriter(new FileWriter("output.txt"));

			// Get the object of DataInputStream
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));

			String strLine, outputLine;

			int line = 0;
			int control = 0;
			int count = 0;

			int[] check = new int[128];

			int A = 0, B = 0;

			//to get rid of the first line
			br.readLine();

			//Read File Line By Line
			while ((strLine = br.readLine()) != null)   {

				String tempString = "";

				control = 0;
				count = 0;

				line++;

				outputLine = "Case #"+line+": ";
				//outputLine = "";

				for (int i = 0; i < strLine.length(); ++i)
				{
					if (strLine.charAt(i) == ' ' || i == strLine.length()-1)
					{
						if (i == strLine.length()-1)
						{
							tempString += ""+strLine.charAt(i);
						}
						switch (control)
						{
							case 0 :
								A = Integer.parseInt(tempString);
								break;
							case 1 :
								B = Integer.parseInt(tempString);
								break;
						}
						control++;
						tempString = "";
						continue;
					}
					tempString += ""+strLine.charAt(i);
				}

				System.out.println(A+" "+B);

				for (int i = A; i <= B; ++i)
				{
					int digit = String.valueOf(i).length();

					check = new int[digit];

					for (int j = 0; j < digit; ++j)
					{
						check[j] = 0;
					}

					for (int j = 1; j < digit; ++j)
					{
						String testingStr = String.valueOf(i);
						String anotherStr = testingStr.substring(j)+testingStr.substring(0,j);

						if (anotherStr.charAt(0) == '0') continue;

						int pairTesting = Integer.parseInt(anotherStr);

						if (A <= pairTesting && pairTesting <= B && pairTesting != i)
						{
							boolean checked = false;
							for (int k = 0; k < j; ++k)
							{
								if (pairTesting == check[k])
								{
									checked = true;
								}
							}
							if (!checked)	
							{
								check[j] = pairTesting;
								count++;
							}
						}
					}
				}

				count /= 2;
				outputLine += ""+count;

				out.write(outputLine);
				out.newLine();
				System.out.println(outputLine);
			}
			//Close the input stream
			in.close();
			out.close();
		}catch (Exception e){//Catch exception if any
			System.err.println("Error: " + e.getMessage());
		 }
	}
}
