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.util.*;
import java.io.*;

public class Palabras{

		static int T;
		static int matrix[][];
		static int valores[];
	    static BufferedReader input;
   
		static StringTokenizer token;
		static String leerLinea() throws IOException 
		{
		        String linea = input.readLine();
				if(linea!=null)
				{
					token = new StringTokenizer(linea," ");
				}
				return linea;
		}
		
    static String siguiente() 
    {
		return token.nextToken(); 
	}
	
	static void escribirArchivo(String data) throws IOException
	{
		PrintWriter output = new PrintWriter(new BufferedWriter(new FileWriter(data)));

		for(int i=0; i<T; i++)
		{
			output.println("Case #"+(i+1)+": "+valores[i]);
		}
		
		output.close();
	}
	
    static int siguienteInt() 
    { 
		return Integer.parseInt(siguiente()); 
	}
	
	
	static void procesarDatos()
	{
		for(int i=0; i<T; i++)
		{
				for(int k=matrix[i][0]; k<=matrix[i][1]; k++)
				{
					String num=k+"";
					String alt="";
					int tam=num.length();
					int numero=0;
					boolean repetido=true;
					
					
					for(int l=0;l<tam-1 && tam>1; l++)
					{
						alt=num.substring(l+1, tam)+num.substring(0,l+1);
						numero = Integer.parseInt(alt);
						//System.out.println("alt "+numero);
						if(numero >= matrix[i][0] && numero <= matrix[i][1] && !num.equals(alt)){valores[i]++;}
					}
			/*		for(int l=0;l<tam-1 && tam>1; l++)
					{
						if(!num.substring(l+1, l+2).equals(num.substring(l,l+1)))
						{
							repetido = false;
						}
					}
					if(repetido && tam>1){valores[i]--;}
			*/	}
			valores[i] = valores[i]/2;
		}
	}
    
    
    public static void main(String[] args) throws IOException {

		input = new BufferedReader(new FileReader(new File("prueba.in")));
		//System.out.println("jd");
        T = Integer.parseInt(leerLinea());
        
        

        if(T<1 || T>1000)
        {
			System.out.println("ERROR T");
			}
		matrix = new int[T][2];
		valores = new int[T];
		for(int i=0; i<T; i++)
		{
			leerLinea();
			matrix[i][0] = siguienteInt();
			matrix[i][1] = siguienteInt();
		}
		procesarDatos();
		
        escribirArchivo("prueba.out");
        
		
    }

}


