/*
 * 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.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Scanner;

public class  Main
{
	private static int recycled(int n, int m)
	{
		String sN = (new Integer(n)).toString();
		String sM = (new Integer(m)).toString();
		int nL = sN.length();
		int mL = sM.length();
		
		HashMap<Integer, HashSet<Integer>> pairs = new HashMap<Integer, HashSet<Integer>>();
		
		for(int i = 0; i < nL; i++)
		{
			String swap = sN.substring(nL-1-i);
			String test = swap + sN.substring(0, nL-1-i);
			int testS = Integer.parseInt(test);
			if(testS == m)
			{
				if(!pairs.containsKey(testS))
				{
					HashSet<Integer> newSet = new HashSet<Integer>();
					newSet.add(m);
					pairs.put(testS, newSet);
				}
				else
				{
					pairs.get(testS).add(m);
				}
			}
		}
		
		Iterator<Integer> iter = pairs.keySet().iterator();
		int sum = 0;
		while(iter.hasNext())
		{
			sum += pairs.get(iter.next()).size();
		}
		
		return sum;
	}
	
	
	public static void main(String[] args)
	{
		Scanner inScan = new Scanner(System.in);
		
		int T = inScan.nextInt();
		//System.out.println(T);
		
		for(int t = 0; t < T; t++)
		{
			int A, B;
			
			A = inScan.nextInt();
			B = inScan.nextInt();
			//System.out.println(A);
			//System.out.println(B);
			int sum = 0;
			for(int n = A; n <= B; n++)
			{
				for(int m = B; m > n; m--)
				{
					sum += recycled(n, m);
					//System.out.println("LOOP");
				}
			}
			
			System.out.println("Case #" + (t+1) + ": " + sum);
		}
	}
}