import java.io.*;

class code1
{
	public static void main(String args[]) throws Exception 
	{
		File ii = new File ("C-small-attempt1.in");
		FileInputStream fis = new FileInputStream(ii);
		BufferedReader  br = new BufferedReader(new InputStreamReader (fis));
		int cases = Integer.parseInt(br.readLine());
		FileOutputStream fout = new FileOutputStream ("output.txt");
		DataOutputStream dout = new DataOutputStream (fout);
		int total=0;
		for(int i=0;i<cases;i++){
		String temp = br.readLine();
		String parts [] = temp.split(" ");
		int lower = Integer.parseInt(parts[0]);
		int upper = Integer.parseInt(parts[1]);
		System.out.println(lower+" "+upper);
		
		for(int j=lower;j<=upper;j++)
		{
			int abc = j;int length=0;
			if(j<10)continue;
			while (abc!=0){abc/=10;length++;}
			abc=j;
			for(int m=0;m<length-1;m++){
				int shift = abc%10;
				abc=abc/10;
				System.out.println("hi "+j);
				abc=abc+shift*power(10,length-1);
				if(abc<=upper&&shift!=0&&abc>j)total++;
				System.out.println(total);
			}
		}
 		dout.writeBytes("Case #"+(i+1)+ ": "+total+"\n");
 		total=0;
		}//for close
		
	}

	private static int power(int i, int j) {
		int no=1;
		for(int a=0;a<j;a++){no=10*no;}
		return no;
	}
}
import java.util.*;
import java.io.*;

public class Mirror {
	public static void main(String[] args) throws IOException { 
		Scanner scan = new Scanner(new File("C-small-attempt0.in"));
		FileWriter fstream = new FileWriter("out.txt");
		BufferedWriter out = new BufferedWriter(fstream);
		int numCases = scan.nextInt();
		for (int z = 0; z < numCases; z++) {
			int low = scan.nextInt();
			int high = scan.nextInt();
			int count = 0;
			for (int i = low; i < high; i++) {
				String lows = "" + i;
				String[] arr = new String[lows.length() - 1];
				for (int k = 0; k < arr.length; k++) {
					lows = lows.charAt(lows.length()-1) + lows.substring(0, lows.length()-1);
					arr[k] = lows;
				}
				for ( int j = i + 1; j <= high; j++) {
					String highs = "" + j;
					for (int k = 0; k < arr.length; k++) {
						if (arr[k].equals(highs)) {
							count++;
							break;
						}
					}
				}
			}
			out.write("Case #" + (z+1) + ": " + count);
			if ( z != numCases - 1)
				out.newLine();
		}
		out.close();
	}
}