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 glycine.gcj2012.qr;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;

public class ProblemC {
	private static Set<String> set = new HashSet<String>();

	private static void countRecycle(String numStr, int min, int max) {
		int num = Integer.valueOf(numStr);

		for (int i = 1; i < numStr.length(); ++i) {
			String frontStr = numStr.substring(0, i);
			String backStr = numStr.substring(i, numStr.length());
			if (backStr.charAt(0) == '0') {
				continue;
			}
			String newNumStr = backStr + frontStr;
			int newNum = Integer.valueOf(newNumStr);
			if (newNum >= min && newNum <= max && newNum > num) {
				// System.out.println( numStr + ", " + newNumStr);
				set.add(numStr + ":" + newNumStr);
			}

		}
		return;
	}

	private static void solve(String minStr, String maxStr) {
		set.clear();
		int min = Integer.valueOf(minStr);
		int max = Integer.valueOf(maxStr);
		int length = minStr.length();
		for (int i = min; i <= max; ++i) {
			String numStr = Integer.toString(i);
			countRecycle(numStr, min, max);

		}

		// System.out.println("result = " + set.size());
	}

	public static void main(String[] args) throws IOException {
		if (args.length != 1) {
			System.err.println("Usage: <program> inputFilename");
			return;
		}
		BufferedReader reader = new BufferedReader(new FileReader(args[0]));
		String line = reader.readLine();
		int times = Integer.parseInt(line);
		for (int i = 0; i < times; ++i) {
			line = reader.readLine();
			String[] tokens = line.split(" ");
			solve(tokens[0], tokens[1]);
			System.out.println("Case #" + (i+1) + ": " + set.size());

		}
	}

}
