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


public class Recycled {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		
		String inStr = null;
		int numCases = 0;
		
		
		try {
			inStr = br.readLine();
			numCases = Integer.parseInt(inStr);
			for (int i = 0; i < numCases; i++) {
				inStr = br.readLine();
				System.out.println("Case #" + (i+1) + ": " + checkNums(inStr));
			}
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}
	
	public static int checkNums(String s) {
		int [] n, m;
		int length, A, B;

		int result = 0;
		Scanner ints = new Scanner(s);
		
		A = ints.nextInt();
		B = ints.nextInt();
		
		length = (s.length()-1) / 2;
				
		n = new int[length];
		m = new int[length];
		
		for (int i = A; i < B; i++) {
			for (int j = i+1; j <= B; j++) {
				String nStr = "" + i;
				String mStr = "" + j;
				
				for (int x = 0; x < length; x++) {
					n[x] = nStr.charAt(x) - 48;
					m[x] = mStr.charAt(x) - 48;
				}
				for (int x = 0; x < length - 1; x++) {
					int tempInt = n[length - 1];
					for (int y = length - 1; y > 0; y--) {
						n[y] = n[y-1];
					}
					n[0] = tempInt;
					if (isEqual(n, m, length)) {
						result++;
						break;
					}
				}
				
				
				
				
			}
		}
		

		return result;
	}
	
	public static Boolean isEqual(int[] m, int [] n, int length) {

		for (int i = 0; i < length; i++) {
			if (n[i] != m[i]) return false;
		}
		
		return true;
	}

}
