/*
 * 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.google.jam.recycled.numbers;

import java.util.HashMap;
import java.util.Map;
import java.util.SortedSet;
import java.util.TreeSet;

public class RNumber implements Comparable<RNumber> {

	private final int n;

	private final int rank;

	private final SortedSet<Integer> recycledNumbers = new TreeSet<Integer>();

	private static final Map<Integer, RNumber> cache = new HashMap<Integer, RNumber>();

	private RNumber() {
		assert false;
		n = 0;
		rank = 0;
	}

	private RNumber(int n) {
		this.n = n;

		int i = 0;
		for (i = 1; (n / (int) Math.pow(10, i)) > 0; i++)
			;
		rank = i - 1;

		for (int x = (int) Math.pow(10, rank), y = 10; x > 0; x /= 10, y *= 10) {
			int recycledNumber = (n % x) * y + (n / x);

			if (recycledNumber > n)
				recycledNumbers.add(recycledNumber);
		}
	}

	public static RNumber valueOf(int i) {
		if (!cache.containsKey(i))
			cache.put(i, new RNumber(i));

		return cache.get(i);
	}

	@Override
	public int compareTo(RNumber o) {
		return n - o.n;
	}

	@Override
	public boolean equals(Object obj) {
		if (this == obj)
			return true;

		if (!(obj instanceof RNumber))
			return false;

		RNumber o = (RNumber) obj;
		return n == o.n;
	}

	@Override
	public int hashCode() {
		return n;
	}

	public int getNumRecycledNumbersLessThan(int m) {
		int count = 0;
		for (Integer rn : recycledNumbers)
			if (rn > m)
				break;
			else
				count++;
		return count;
	}

}
