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.io.FileInputStream;
import java.io.FileNotFoundException;
import java.util.HashSet;
import java.util.Scanner;

public class C {
	public static int factorial(int x) {

		int fact = 1;

		for (int i = 2; i <= x; i++) {

			fact *= i;

		}
		return fact;
	}

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
//		Scanner s = null;
//		try {
//			s = new Scanner(new FileInputStream("s.in"));
//		} catch (FileNotFoundException e) {
//			// TODO Auto-generated catch block
//			e.printStackTrace();
//		}
		int lines = s.nextInt();
		for (int i = 1 ; i <= lines ;i++){
			int A = s.nextInt();
			int B = s.nextInt();
			HashSet<Integer> h = new HashSet<Integer>();
			for (int j  = A;j<=B;j++){
				h.add(j);
			}
			
			int comb = 0;
			for (int j  = A;j<=B;j++){
				if (!h.remove(j)){
					continue;
				}
				int len = (int)Math.log10(j);
				int c = 1;
				int newj = j;
				for (int k = 0; k < len;k++){
					newj = newj/10 + (newj % 10)*((int)Math.pow(10, len));
					if (h.remove(newj)){
						
						c++;
					}
				}
				if (c !=1){
					comb += factorial(c)/(factorial(c-2)*2);
				}
				
			}
			System.out.printf("Case #%d: %d\n",i,comb);
		}
	}
}
