import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfCopyOfMain {

	static int ndigits(int n) {
		return (int) (Math.log10(n) + 1);
	}

	static int rot(int n, int dig) {
		return (int) ((n % 10) * Math.pow(10, dig - 1)) + (int) (n / 10);
	}

	public static void main(String[] args) throws FileNotFoundException {
		String file = "C-large";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for (int t = 1; t <= T; t++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int c = 0;
			int[] list = new int[ndigits(B)];
			numbers: for (int i = A; i <= B; i++) {
				int digs = ndigits(i);
				int rot = i;
				int pairs = 0;

				Arrays.fill(list, -1);
				list[0] = i;

				digits: for (int j = 1; j <= digs + 1; j++) {

					rot = rot(rot, digs);
					if(rot < i)
						continue;

					if (A <= rot && rot <= B) {
						for (int k = 0; k < j; k++) {
							if (list[k] == rot) {
								continue digits;
							}
						}
						pairs++;
						list[j] = rot;
					}
				}

				//c += pairs * (pairs + 1) / 2;
				c += pairs ;
				// c+=digs;
			}
			out.println("Case #" + t + ": " + c);
		}

		in.close();
		out.close();
	}
}

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;


public class RecycledNumbers {

	public static void main(String[] args){
		try{
			// Open the file that is the first 
			// command line parameter
			FileInputStream fstream = new FileInputStream(args[0]);
			// Get the object of DataInputStream
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String strLine;
			//Read File Line By Line
			int numTest = Integer.parseInt(br.readLine());
			for(int i = 0; i < numTest; i ++){
				String str = br.readLine();
				String numbers[] = str.split(" ");
				int count = recycledNumbers(Integer.parseInt(numbers[0]),Integer.parseInt(numbers[1]));
				int x = i + 1;
				System.out.println("Case #" + x + ": " + count);
				
			}
			//Close the input stream
			in.close();
		}catch (Exception e){//Catch exception if any
			System.err.println("Error: " + e.getMessage());
		}
		
		
	}
	
	public static int recycledNumbers(int min, int max){
		int digits = Integer.toString(min).length();
		int current = min;
		int count = 0;
		while(current <= max){
			ArrayList<Integer> newNumbers = new ArrayList<Integer>();
			for(int i = 1; i < digits; i++){
				String movedDigits = Integer.toString(current).substring(i);
				String remainingDigits;
				if(i == 1){
					remainingDigits = Character.toString(Integer.toString(current).charAt(0));
				}
				else{
					remainingDigits = Integer.toString(current).substring(0,i);
				}
				int newNumber = Integer.parseInt(movedDigits + remainingDigits);
				if(newNumber != current && newNumber <= max && newNumber >= min ){
					boolean alreadyExists = false;
					for(Integer no : newNumbers){
						if(no.intValue() == newNumber){
							alreadyExists = true;
						}
					}
					if(!alreadyExists){
						if(current < newNumber){
							count ++;
							//System.out.println("(" + current + "," + newNumber + ")");
							newNumbers.add(new Integer(newNumber));
						}
					}
				}
				
			}
			current++;
		}
		
		return count;
	}
	
}




