/*
 * 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 Recycle
{
	public static int[] combi = {0,0,1,3,6,10,16,21};
	
	public static boolean[] bool;
	
	public static int howMany(int x, int least, int greatest)
	{
		int rotate = x;
		int pair = 1;
		int i;
		int j;
		int dummy;
		ArrayList<Integer> digit = new ArrayList<Integer>();
		bool[rotate]=true;
		while (rotate>0)
		{
			digit.add(rotate%10);
			rotate=rotate/10;
		}

		for (i=1; i<digit.size(); i++)
		{
			dummy=digit.get(0);
			digit.remove(0);
			digit.add(dummy);
			if (digit.get(digit.size()-1)!=0)
			{
				rotate=0;
				for (j=digit.size()-1; j>=0; j--)
					rotate = rotate*10+digit.get(j);
				if (((rotate<=greatest) && (rotate>=least))&&(bool[rotate]==false))
				{
					//System.out.println(rotate);
					bool[rotate]=true;
					pair++;
				}
			}
		}
		return (combi[pair]);
	}

	public static void main (String[] args)
	{
		Scanner myInput = new Scanner(System.in);
		int T;
		int t;
		T = myInput.nextInt();
		int i;
		int A;
		int B;
		int result;
		for (t=1; t<=T; t++)
		{
			A=myInput.nextInt();
			B=myInput.nextInt();
			result=0;
			bool = new boolean[B+1];
			for (i=A; i<=B; i++)
				if (bool[i]==false)
					result=result+howMany(i,A,B);
			System.out.println("Case #"+t+": "+result);
		}

	}
	
}
