/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

import java.io.File;
import java.io.FileInputStream;
import java.util.Scanner;

/**
 *
 * @author imgps
 */
public class C {
    public static void main(String args[]) throws Exception{
        int A,B;
        int ctr = 0;
        int testCases;
        
        Scanner sc = new Scanner(new FileInputStream("C-small-attempt0.in "));
        testCases = sc.nextInt();
        int input[][] = new int[testCases][2];
        for(int i=0;i<testCases;i++)
        {
          //  System.out.print("Enter input A B: ");
            input[i][0] = sc.nextInt();
            input[i][1] = sc.nextInt();
            
        }
  

for(int k=0;k<testCases;k++){
      ctr = 0;
      A = input[k][0];
      B = input[k][1];
        for(int i = A;i<=B;i++){
            int num = i;
            int nMul = 1;
            int mul = 1; 
            int tnum = num/10;
            while(tnum > 0){
                mul = mul *10;
                tnum= tnum/10;
            }
            tnum = num;
            int n = 0;
            while(tnum > 0 && mul >= 10){
                nMul = nMul * 10;
                n = (num % nMul) * mul + (num / nMul);
                mul = mul / 10;
                tnum = tnum / 10;
                for(int m=num;m<=B;m++){
                    
                    if(n == m && m > num){
                        ctr++;
                    }
                }
                
                
                
         
            }
        }
        System.out.println("Case #"+(k+1)+": "+ctr);
        
    }
    }
}

import java.io.*;
import java.util.*;
import java.math.*;
import java.text.*;

public class C {
	public static void pl(Object O) {System.out.println(O);}
	public static void pl() {System.out.println();}
	public static void pr(Object O) {System.out.print(O);}
	public static void p(Object O) {System.out.print(O);}
	public static void pf(String f, Object...args) {System.out.printf(f,args);}
	
	public static Scanner sc;
	public static String n() {return sc.next();}
	public static String nl() {return sc.nextLine();}
	public static int ni() {return sc.nextInt();}
	public static double nd() {return sc.nextDouble();}
	
	public static void main(String[] args) throws Exception {
		String file = args.length>0?args[0]:"c-sample.in";
		sc = new Scanner(new File(file));
		
		int kk = ni(); nl();
		for (int qq = 0; qq < kk; qq++) {
			System.out.printf("Case #%d: ",qq+1);
			
			int A = ni();
			int B = ni();
			
			int count = 0;
			
			for (int n = A; n < B; n++) {
				for (int m = n+1; m <= B; m++) {
					boolean recycled = isRecycled(n,m);
					if(recycled) {
						count++;
//						System.out.printf("(%d,%d) is recycled\n",n,m);
					}
				}
			}
			
			p(count);
			pl();
		}
	}	
	
	/**
	 * A pair is a recycled pair if you can rotate the digits of n to get m. In
	 * order words, if you let N:=string(n)+string(n) and string(m) is a
	 * substring of N, then the pair (n,m) is a recycled pair.
	 * 
	 * @param n
	 * @param m
	 * @return true if recycled pair
	 */
	public static boolean isRecycled(int n, int m) {
		String N = ""+n+n;
		String M = ""+m;
		
//		System.out.println(N);
//		System.out.println(M);
		
		return N.contains(M);
	}
}
