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 com.sokamura.gcj2012;

import java.io.BufferedReader;
import java.io.FileReader;
import java.util.HashSet;
import java.util.Set;

public class RecycledNumbers {
	public int solve(int n1, int n2) {
		int ans = 0;
		for(int i=n1; i<n2; ++i) {
			Set<Integer> list = generate(i);
			for(int n : list) {
				if(n <= n2){ ans++; }
			}
		}
		return ans;
	}
	
	private Set<Integer> generate(int n) {
		String s = String.valueOf(n);
		Set<Integer> list = new HashSet<Integer>();
		for(int i=1; i<s.length(); ++i) {
			int n2 = Integer.parseInt(s.substring(i) + s.substring(0, i));
			if(n < n2) {
				list.add(n2);
			}
		}
		return list;
	}
	
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO ©®¶¬³ê½\bhEX^u
		RecycledNumbers rn = new RecycledNumbers();
		try {
			FileReader fr = new FileReader("C-small-attempt1.in");
			BufferedReader br = new BufferedReader(fr);
			String lineNum;
			lineNum = br.readLine();
			for(int i=1; i<=Integer.parseInt(lineNum); ++i) {
				String line = br.readLine();
				String[] array = line.split(" ");
				int n1 = Integer.parseInt(array[0]);
				int n2 = Integer.parseInt(array[1]);
				System.out.println("Case #" + i + ": " + rn.solve(n1,n2));
			}
		}
		catch(Exception e) {
			e.printStackTrace();
		}
	}

}
