import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

class RecycledNumbers{
	
	
	
	int getcount(int small,int large){
		int count = 0;
		for(int currnum = small; currnum < large; currnum++){
			int permut = currnum;
			int no_of_digits = 0;
			while(permut > 0){
				permut = permut/10;
				no_of_digits++;
			}
			int lastDigit = currnum % 10;
			permut = currnum / 10;
			permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
			while(permut != currnum){
				
				if(permut >= currnum && permut <= large){
					
					count++;
				}
				lastDigit = permut % 10;
				permut = permut / 10;
				permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
				
			}
			
		}
		
		return count;
	}
	
	public static void main(String args[]){
		RecycledNumbers d = new RecycledNumbers();
		
		int no_of_cases = 0;
		String input = "";
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		try{
			no_of_cases = Integer.parseInt(br.readLine());
		}
		catch(Exception e){
			System.out.println("First line is not a number");
		}
		
		for(int i=1; i <= no_of_cases;i++){
			try{
				input = br.readLine();
			}
			catch(Exception e){
				System.out.println("Number of test cases different from the number mentioned in first line");
			}
			
			System.out.print("Case #" +i+": ");
			
			StringTokenizer t =  new StringTokenizer(input);
			int small=0,large=0;
			if(t.hasMoreTokens()){
				small = Integer.parseInt(t.nextToken());
			}
			if(t.hasMoreTokens()){
				large = Integer.parseInt(t.nextToken());
			}
			System.out.println(d.getcount(small,large));
			
		}
		
		
		

	}
	
	
}
package be.mokarea.gcj.recyclednumbers;

import java.io.PrintWriter;
import java.util.HashSet;

import be.mokarea.gcj.common.TestCaseReader;
import be.mokarea.gcj.common.Transformation;

public class RecycledNumbersTransformation extends
		Transformation<RecycledNumbersTestCase> {

	public RecycledNumbersTransformation(
			TestCaseReader<RecycledNumbersTestCase> caseReader,
			PrintWriter outputWriter) {
		super(caseReader, outputWriter);
	}

	@Override
	protected String transform(RecycledNumbersTestCase testCase) {
		HashSet<PairOfInteger> setOfN_M = new HashSet<PairOfInteger>();
		final int a = testCase.getA();
		final int b = testCase.getB();
		for (int n = a; n <= b; n++) {
			for (int m : recycledNumberOf(n)) {
				if ( a <= n && n < m && m <= b) {
					setOfN_M.add(new PairOfInteger(n,m));
				}
			}
		}
		return formatOutput(testCase.getCaseNumber(), setOfN_M.size());
	}
	
	private String formatOutput(int caseNumber, int nbMatches) {
		StringBuffer buf = new StringBuffer();
		buf.append("Case #");
		buf.append(caseNumber);
		buf.append(": ");
		buf.append(nbMatches);
		return buf.toString();
	}

	private HashSet<Integer> recycledNumberOf(int n) {
		HashSet<Integer> recycledNumbers = new HashSet<Integer>();
		String nAsString = String.valueOf(n);
		for (int nbDigit = 1 ; nbDigit < nAsString.length(); nbDigit++) {
			final String end = nAsString.substring(nbDigit, nAsString.length());
			final String front = nAsString.substring(0, nbDigit);
			final String n2 = end + front;
			recycledNumbers.add(Integer.parseInt(n2));
		}
		return recycledNumbers;
	}

	class PairOfInteger {
		@Override
		public int hashCode() {
			final int prime = 31;
			int result = 1;
			result = prime * result + m;
			result = prime * result + n;
			return result;
		}

		@Override
		public boolean equals(Object obj) {
			if (this == obj)
				return true;
			if (obj == null)
				return false;
			if (getClass() != obj.getClass())
				return false;
			PairOfInteger other = (PairOfInteger) obj;
			if (m != other.m)
				return false;
			if (n != other.n)
				return false;
			return true;
		}

		private final int n;
		private final int m;
		
		PairOfInteger(int n, int m) {
			this.n = n;
			this.m = m;
		}
	}
}
