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.recycle;

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

public class Recycle {

	public String solve(String s) {

		String[] ss = s.split(" ");
		int a = Integer.parseInt(ss[0]);
		int b = Integer.parseInt(ss[1]);

		int n = ("" + a).length();
		int m = 0;

		for (int i = a; i <= b; i++) {
			int[] digits = collectDigits(i);
			Set<Integer> done = new HashSet<Integer>();
			for (int j = 1; j < n; j++) {
				int t = offsetNum(digits, j);
				if (t <= b && t > i && done.add(t)) {
					m++;
				}
			}
		}

		return "" + m;
	}

	private int[] collectDigits(int num) {
		int n = ("" + num).length();
		int[] digits = new int[n];
		int i = n;
		while (i > 0) {
			digits[--i] = num % 10;
			num = (int) (num / 10d);
		}
		return digits;
	}

	private int offsetNum(int[] x, int m) {

		int a = 0;

		for (int i = 0; i < x.length; i++) {
			a += x[(i + m) % x.length] * Math.pow(10, x.length - 1 - i);
		}

		return a;
	}
}
