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));
			
		}
		
		
		

	}
	
	
}
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;

public class ProblemC {
	
	public static void main(String[] args){
		
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		
		try{
			
			String line = in.readLine();

			int numLines = Integer.parseInt(line);

			for(int i = 1; i <= numLines; i++){
				
				System.out.print("Case #" + i + ": ");
				
				line = in.readLine();
				
				String[] nums = line.split(" ");
				
				int A = Integer.parseInt(nums[0]);
				int B = Integer.parseInt(nums[1]);
				
				int size = nums[0].length();
				
				int count = 0;
				
				for(int n = A; n < B; n++){
					String nStr = String.valueOf(n);
					ArrayList<String> pairs = new ArrayList<String>();
					for(int k = 1; k < size; k++){
						String mStr = nStr.substring(k, size) + nStr.substring(0, k);
						int m = Integer.parseInt(mStr);
						if(m > n && m <= B){
							String nm = n + "," + m;
							if(!pairs.contains(nm)){
								pairs.add(nm);
								count++;
							}
						}
					}
				}
				
				System.out.println(count);
			}
		}catch(IOException e){
			
		}
	}
}