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

package com.ravi;

import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class RecycledNumbers {
	private static boolean matches(String a, String b) {
		if (a.equals(b)) {
			return false;
		}
		for (int j = 0; j < a.length(); j++) {
			if (!b.contains("" + a.charAt(j))) {
				return false;
			}
			// Remove the matched character
			b = b.replaceFirst("" + a.charAt(j), "");
		}
		return true;
	}

	private static Integer getRecycledPairs(String A, String B) {
		int a = Integer.parseInt(A);
		int b = Integer.parseInt(B);
		if (a < 10 || b < 10) {
			return 0;
		}

		Set<String> pairs = new HashSet<>();
		for (int n = a; n <= b; n++) {
			for (int m = a + 1; m <= b; m++) {
				if (n < m) {
					String nStr = n + "";
					String mStr = m + "";
					if (matches(nStr, mStr)) {
						for (int i = 0; i < nStr.length() - 1; i++) {
							String newNStr = nStr.substring(i + 1)
									+ nStr.substring(0, i + 1);
							if (newNStr.equals(mStr)) {
								pairs.add(nStr + "," + mStr);
							}
						}
					}
				}
			}
		}
		return pairs.size();
	}

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		in.nextLine();
		for (int i = 1; i <= T; i++) {
			String thisLine = in.nextLine();
			String[] AB = thisLine.split(" ");
			System.out.println("Case #" + i + ": "
					+ getRecycledPairs(AB[0], AB[1]));
		}
	}
}