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

public class RecycledNumbers 
{
    public static void main(String[] args) 
    {
       StringTokenizer st;
       BufferedReader br = null;
 
		try {
                        FileWriter fstream = new FileWriter("output.out");
                        BufferedWriter out = new BufferedWriter(fstream);
			String sCurrentLine;
 
			br = new BufferedReader(new FileReader("C-small-attempt0.in"));
                        sCurrentLine = br.readLine();//no. of cases
                        int i = 1;
                        while ((sCurrentLine = br.readLine()) != null) 
                        {     
                            out.write("Case #" + i++ + ": ");
                            st = new StringTokenizer(sCurrentLine," ");
                            String n = st.nextToken();
                            int N = Integer.parseInt(n);
                            int m = Integer.parseInt(st.nextToken());
                            int count = 0;
                            for (int j = N; j < m; j++) 
                            {
                                String recycled = Integer.toString(j);
                                LinkedList<String> possible_rotations = new LinkedList<String>();
                                for (int k = 0; k < n.length(); k++)
                                {
                                    recycled = recycled.substring(1)+recycled.charAt(0);
                                    if(!possible_rotations.contains(recycled) && Integer.parseInt(recycled) > j && Integer.parseInt(recycled) <= m)
                                        count++;
                                    possible_rotations.addLast(recycled);
                                }
                            }
                            out.write(count + "\n");
                        }
                        out.close();
 
		} catch (IOException e) {
			e.getMessage();
		} finally {
			try {
				if (br != null)br.close();
			} catch (IOException ex) {
				ex.getMessage();
			}
		} 
    }
}
