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 codejam.recyclednumbers;

import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;

public class DigitsArray implements Comparable<DigitsArray> {

	private int[] digits;

	private DigitsArray() {
	}

	public DigitsArray(String numberAsString) {
		char[] charArray = numberAsString.toCharArray();
		this.digits = new int[charArray.length];
		for (int i = 0; i < digits.length; i++) {
			digits[i] = Integer.parseInt("" + charArray[i]);
		}
	}

	public DigitsArray(int[] digits) {
		this.digits = digits;
	}

	public DigitsArray(Integer number) {
		this(number.toString());
	}

	public int numberRecycles(DigitsArray minValue, DigitsArray maxValue) {
		Set<DigitsArray> correctRecycles = new HashSet<>();
		for (int i = 1; i < digits.length; i++) {
			if (digits[i] < digits[0] || digits[i] < minValue.digits[0]
					|| digits[i] > maxValue.digits[0]) {
				continue;
			}
			DigitsArray recycle = recycle(i);
			if (recycle.compareTo(this) > 0 && recycle.compareTo(minValue) >= 0
					&& recycle.compareTo(maxValue) <= 0) {
				correctRecycles.add(recycle);
			}
		}
		return correctRecycles.size();
	}

	private DigitsArray recycle(int recycleIndex) {
		DigitsArray result = new DigitsArray();
		int length = digits.length;
		result.digits = new int[length];
		for (int i = 0; i < length; i++) {
			result.digits[i] = digits[(i + recycleIndex) % length];
		}
		return result;
	}

	@Override
	public int compareTo(DigitsArray o) {
		if (digits.length > o.digits.length) {
			return 1;
		}
		if (digits.length < o.digits.length) {
			return -1;
		}
		for (int i = 0; i < digits.length; i++) {
			if (digits[i] > o.digits[i]) {
				return 1;
			}
			if (digits[i] < o.digits[i]) {
				return -1;
			}
		}
		return 0;
	}

	@Override
	public int hashCode() {
		final int prime = 31;
		int result = 1;
		result = prime * result + Arrays.hashCode(digits);
		return result;
	}

	@Override
	public boolean equals(Object obj) {
		if (this == obj)
			return true;
		if (obj == null)
			return false;
		if (getClass() != obj.getClass())
			return false;
		DigitsArray other = (DigitsArray) obj;
		if (!Arrays.equals(digits, other.digits))
			return false;
		return true;
	}

}
