package qual;

import java.util.Scanner;

public class RecycledNumbers {

	public static void main(String[] args) {
		new RecycledNumbers().run();

	}

	private void run() {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int t = 0; t < T; t++) {
			int A = sc.nextInt();
			int B = sc.nextInt();
			int result = solve(A, B);
			System.out.printf("Case #%d: %d\n", t + 1, result);
		}
	}

	public int solve(int A, int B) {
		int result = 0;
		for (int i = A; i <= B; i++) {
			int dig = (int) Math.log10(A/*same as B*/) + 1;
			int aa = i;
			for (int d = 0; d < dig - 1; d++) {
				aa = (aa % 10) * (int)Math.pow(10, dig - 1) + (aa / 10);
				if (i == aa) {
					break;
				}
				if (i < aa && aa <= B) {
//					System.out.printf("(%d, %d) ", i, aa);
					result++;
				}
			}
		}
		return result;
	}

}

package mgg.utils;

import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;

/**
 * @author manolo
 * @date 13/04/12
 */
public class CombinatoryUtils {

	public static List<Integer> findAddingCombination(int total, 
			List<Integer> listOfNumbers) {

		ArrayList<Integer> solution = new ArrayList<Integer>();

		for (int i = 0; i < listOfNumbers.size(); i++){
			for (int j = 0; j < listOfNumbers.size(); j++){

				if( (i != j) &&
						(listOfNumbers.get(i) + listOfNumbers.get(j) == total) ){
					solution.add(listOfNumbers.get(i));
					solution.add(listOfNumbers.get(j));
					return solution;
				}

			}
		}
		return null;
	}

	public static List<Integer> findAddingCombinationIndices(int total, 
			List<Integer> listOfNumbers) {

		ArrayList<Integer> solution = new ArrayList<Integer>();

		for (int i = 0; i < listOfNumbers.size(); i++){
			for (int j = 0; j < listOfNumbers.size(); j++){

				if( (i != j) &&
						(listOfNumbers.get(i) + listOfNumbers.get(j) == total) ){
					solution.add(i);
					solution.add(j);
					return solution;
				}

			}
		}
		return null;
	}

	public static List<Integer> findAddingCombinationIndicesBase1(int total, 
			List<Integer> listOfNumbers) {

		ArrayList<Integer> solution = new ArrayList<Integer>();

		for (int i = 0; i < listOfNumbers.size(); i++){
			for (int j = 0; j < listOfNumbers.size(); j++){

				if( (i != j) &&
						(listOfNumbers.get(i) + listOfNumbers.get(j) == total) ){
					solution.add(i+1);
					solution.add(j+1);
					return solution;
				}

			}
		}
		return null;
	}

	public static List<Triplet> possibleTriplets(int score) {
		List<Triplet> listOfTriplets = new ArrayList<Triplet>();
		
		for(Triplet t : allPossibleTriplets){
			if(t.sum() == score){
				listOfTriplets.add(t);
			}
		}
		
		return listOfTriplets;
	}
	
	private final static List<Triplet> allPossibleTriplets = allPossibleTriplets();
	
	private static List<Triplet> allPossibleTriplets() {

		HashSet<Triplet> set = new HashSet<Triplet>();
		
//		int cont = 0;
		for (int i = 0; i <= 10; i++) {
			for (int j = 0; j <= 10; j++) {
				if(Math.abs(i-j) <= 2){
					for (int k = 0; k <= 10; k++) {
						if((Math.abs(i-k) <= 2) && (Math.abs(j-k) <= 2)){
//							cont++;
//							System.out.println("(" + i + ", " + j + ", " + k + ")\t\tcont = " + cont);7
							set.add(new Triplet(i, j, k));
							
						}
					}
				}
			}	
		}
		
		return new ArrayList<Triplet>(set);

	}

}
