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.Scanner;

/*
 * Google Code Jam 2012
 * Program by Tommy Ludwig
 * Problem: Recycled Numbers
 * Date: 2012-04-13
 * Time: 02:08 AM
 */


public class recycle {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		
		for (int i = 1; i <= T; i++) {
			int A, B, n, m, y = 0;
			A = in.nextInt();
			B = in.nextInt();
			
			for (int j = 0; j < (B-A); j++) {
				m = B - j;
				String strM = String.valueOf(m);
				
				for (int k = 0; k < (B-A); k++) {
					n = A + k;
					//n must be less than m
					if (n >= m)
						break;
					
					String strN = String.valueOf(n);
					
					for (int l = 1; l < strN.length(); l++) {
						String sub = strN.substring(l);
						String new_strN = sub + strN.substring(0, l);
						
						if (new_strN.equalsIgnoreCase(strM)) {
							y++;
							break;
						}
					}
				}
			}
			System.out.printf("Case #%d: %d\n", i, y);
		}
	}

}
