/*
 * 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);
        
    }
    }
}



///REMOVE ALL OUTPUT AND USE STRINGTOKENIZER!


/*
ID: mfranzs1
LANG: JAVA
TASK: RecycledNumbers
*/
import java.io.*;
import java.util.*;

public class RecycledNumbers {
	static BufferedReader f;
	public static void main (String [] args) throws IOException {
		long unixTime = System.currentTimeMillis();
		// Use BufferedReader rather than RandomAccessFile; it's much faster
		f = new BufferedReader(new FileReader("RecycledNumbers.in"));
	                                                  // input file name goes above
	    PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("RecycledNumbers.out")));
	    // Use StringTokenizer vs. readLine/split -- lots faster
	    //StringTokenizer st = new StringTokenizer(f.readLine()," ");	    	
    	//int i = Integer.parseInt(st.nextToken());
	    
	    int cases=Integer.parseInt(f.readLine());
	    for(int c=0;c<cases;c++){
	    	StringTokenizer st = new StringTokenizer(f.readLine()," ");	
	    	int A = Integer.parseInt(st.nextToken());
	    	int B = Integer.parseInt(st.nextToken());
	    	//System.out.println(A+" "+B);
	    	int numRecycled=0;
	    	for(int n=A;n<B;n++){
	    		numRecycled+=rec(n,B);
	    	}
	    	System.out.println("Case #"+(c+1)+": "+numRecycled);
	    	out.println("Case #"+(c+1)+": "+numRecycled);
	    }
	    
	    
	    
	    out.close();                                  // close the output file
	    
	    System.out.println("Time elapsed (ms): "+(System.currentTimeMillis()-unixTime));
	    
	    System.exit(0);                               // don't omit this!
	  }
	public static int rec(int n,int max){
		ArrayList<String> workingPairs = new ArrayList<String>();
		String stringN=""+n;
		for(int swap=1;swap<stringN.length();swap++){
			String next=stringN.substring(swap)+stringN.substring(0,swap);
			int m=Integer.parseInt(next);
			if(n<m&&m<=max&&(m+"").charAt(0)!='0'){
				String add=n+" "+m;
				if(!workingPairs.contains(add)){
					workingPairs.add(add);
				}
				System.out.println(n+" "+m);
			}
			//System.out.println(next);
		}
		return workingPairs.size();
	}
}