/*
 * 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.LinkedList;
import java.util.List;


public class Secundaria 
{
	public Secundaria()
	{
		
	}
	
	public int nVeces(int primero, int ultimo)
	{
		int i = 0;
		
		if(primero <= 9 && ultimo <=9)
			return 0;
		
		LinkedList<Integer> lista;
		for(int j = primero; j <= ultimo; j++)
		{
			lista = deparse(j);
			for(int k = j+1; k <= ultimo; k++)
			{
				for(int r = 0; r < lista.size(); r++)
				{
					int prueba = monta(lista);
					if(k == prueba)
						i++;
					int x = lista.pop();
					lista.addLast(x);
				}
			}
		}
				
		return i;
	}
	
	public int monta(LinkedList<Integer> l)
	{
		int res = 0;
		int a = 1;
		for(int i = 0; i < l.size(); i++)
		{
			for(int k = i;k < l.size(); k++)
				a *= 10;
			
			res += l.get(i) * a;
			a = 1;
		}
		res = res / 10;
		return res;
	}
	
	public LinkedList<Integer> deparse(int k)
	{
		LinkedList<Integer> ret = new LinkedList<Integer>();
		
		int r = k;
		while(r != 0)
		{
			ret.addFirst(r % 10);			
			r = r / 10;
		}
				
		return ret;
	}
}
