/*
 * 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.Arrays;
import java.util.Scanner;


public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner scanner = null;
		try {
			scanner = new Scanner(new File(args[0]));
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		
		int t = Integer.parseInt(scanner.nextLine());
		int count;
		int min, max;
		for (int i = 1; i <= t; i++) {
			count = 0;
			min = scanner.nextInt();
			max = scanner.nextInt();
			for (int j = min; j <= max; j++) {
				for (int k = j+1; k <= max; k++) {
					if (isRecycled(j, k)) {
						count++;
					}
				}
			}
			System.out.println("Case #"+i+": " + count);
		}
	}
	
	private static boolean isRecycled(int n, int m) {
		boolean flag = false;
		char[] na = String.valueOf(n).toCharArray();
		char[] ma = String.valueOf(m).toCharArray();
		if (na.length == ma.length && na[0] != '0' && ma[0] != '0') {
			if (sum(na) == sum(ma)) {
				char tmp;
				for (int i = 0; !flag && i < na.length; i++) {
					tmp = na[na.length-1];
					System.arraycopy(na, 0, na, 1, na.length-1);
					na [0] = tmp;
					if (Arrays.equals(na, ma)) {
						flag = true;
					}
				}
			}
		}
		return flag;
	}
	
	private static int sum(char[] arr) {
		int sum = 0;
		for (int i = 0; i < arr.length; i++) {
			sum += arr[i];
		}
		return sum;
	}

}
