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.DataInputStream;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Iterator;


public class gjam {
	
	public static void main(String[] args)
	{
	
		int TestCases = 0;
		int currentCase = 0;
		
		try
		{
			
		
			FileInputStream fstream = new FileInputStream("C-small-attempt0.in");
			DataInputStream dstream = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(dstream));
			
			String inputStr = br.readLine();
			
			TestCases = Integer.parseInt(inputStr);
			
			while(currentCase != TestCases)
			{
				ArrayList<Integer> results = new ArrayList<Integer>();
				inputStr = br.readLine();
				int result = 0;
				
				String[] inputs = inputStr.split(" ");
				int size = inputs[0].length();
				int A = Integer.parseInt(inputs[0]);
				int B = Integer.parseInt(inputs[1]);
				if(A >= 10 && B > A)
				for(int i = A; i <= B; i++)
				{
					for(int j = 1; j <= size; j++)
					{
						int moved = moveDigits(j,i);
						
						if(A <= i && i < moved && moved <= B)
						{
							
							results.add(i);
							results.add(moved);
							result++;
						}
						
					}
					
					
				}
				
				System.out.println("Case #" + (currentCase +1) + ": " + result);
				currentCase++;
			}
			
			
		}
		catch(Exception e)
		{
			System.err.println("Err: " + e.getMessage());
		}
		
	}
	public static int moveDigits(int numTomove,int input)
	{
		String original = "" + input;
		int length = original.length();
		String sub1 = original.substring(length - numTomove);
		String sub2 = original.substring(0,length - numTomove);
		
		String output = sub1 + sub2;
		
		return Integer.parseInt(output);
	}
	
}
