/*
 * 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.util.*;
class pqr 
{
	public static void main(String arf[])
	{
		int a;
		Scanner sc=new Scanner(System.in);
		a=sc.nextInt();
		int m=1;
		while(a!=0)
		{
			int p=sc.nextInt();
			int q=sc.nextInt();
			
				int max=0;//the answer
					for(int i=p;i<=q;i++)
					{
						
						int count=0;
						int z=i;
						int t=i;
						
						while(z!=0)
						{
						count++;//no of digits
						z=z/10;
						}
		
					
						for(int j=0;j<count-1;j++)
							{
							String s="";
							s=i%(int)(Math.pow(10,(j+1)))+""+i/(int)(Math.pow(10,(j+1)));
							int y=Integer.parseInt(s);
									if(y<=q && y>=t && y>i)	
									{	
									max++;
									}
			//					System.out.println(max);
								
							}
		
					}
					System.out.println("Case #"+m+": "+max);
		a--;	
			m++;		
		}
	}
}
