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

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package uk.co.epii.codejam.recyclednumbers;

import java.util.TreeSet;
import uk.co.epii.codejam.common.AbstractProcessor;

/**
 *
 * @author jim
 */
public class RecycledNumbersProcessor extends AbstractProcessor {

    @Override
    public String processLine(String line) {
        DataRow dr = new DataRow(line);
        if (dr.A > dr.B) return "0";
        int count = 0;
        for (int n = dr.A; n < dr.B; n++) {
            String nStr = n + "";
            TreeSet<Integer> m = new TreeSet<>();
            for (int c = 1; c < nStr.length(); c++) {
                int value = cycle(nStr, c);
                if (value > n && value <= dr.B)
                    m.add(value);
            }
            count += m.size();
        }
        return count + "";
    }
    
    public int cycle(String n, int c) {
        String cycled = n.substring(c, n.length()) + n.substring(0, c); 
        return Integer.parseInt(cycled);
    }
    
    
    
}
