/*
 * 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.File;
import java.io.FileNotFoundException;
import java.util.HashMap;
import java.util.Scanner;

public class CodeJam2012Ex3 {
	public static void main(String arg[]) throws FileNotFoundException {
		File file = new File("C-small-attempt1.in");
		String output;
		Scanner scanner = new Scanner(file);
		int numTestCases = scanner.nextInt();

		for (int i = 0; i < numTestCases; i++) {
			StringBuffer buffer = new StringBuffer("Case #" + (i + 1) + ": ");
			int A = scanner.nextInt();
			int B = scanner.nextInt();
			buffer.append(CodeJam2012Ex3.countPairs(A, B));
			if (i != numTestCases - 1) {
				buffer.append("\n");
			}
			output = buffer.toString();

			System.out.print(output);
		}

	}

	public static int countPairs(int A, int B) {
		int pairs = 0;
		HashMap<String, Boolean> map = new HashMap<String, Boolean>();

		for (int i = A; i <= B; i++) {

			String n = i + "";

			int len = n.length();
			for (int j = 1; j < len; j++) {
				String m = n.substring(len - j) + n.substring(0, len - j);
				int nNum = Integer.parseInt(n);
				int mNum = Integer.parseInt(m);
				if (nNum < mNum && n.length() == (mNum + "").length()
				&& mNum <= B && !map.containsKey((n + m))) {
					map.put(n + m, (Boolean) true);
					pairs++;
				}
			}
		}
		return pairs;

	}
}
