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.FileInputStream;
import java.io.InputStreamReader;


public class Recycled {

	
	public static void main(String[] args){
		Recycled r = new Recycled();
		try{
			  // Open the file that is the first 
			  // command line parameter
			  FileInputStream fstream = new FileInputStream("C-large.in");
			  // 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 numOfTests = Integer.parseInt(br.readLine());
			  for(int i=1; i<=numOfTests; i++){
				  String itemString = br.readLine();
				  System.out.print("Case #"+i+": ");
				  long A = Long.parseLong(itemString.split(" ")[0]);
				  long B = Long.parseLong(itemString.split(" ")[1]);
				  r.countRecycled(A,B);
				  System.out.println();
			  }
			  //Close the input stream
			  in.close();
		}catch (Exception e){//Catch exception if any
			  System.err.println("Error: " + e.getMessage());
		}
	}

	private char[] shuffle(char[] numString){
		//char[] numString = (x+"").toCharArray(); 
		int i=0; 
		char temp=numString[i];
		for(i=0; i<numString.length-1; i++){
			numString[i]=numString[i+1];
		}
		numString[i]=temp;
		return numString;
	}
	private void countRecycled(long a, long b) {
		long count = 0;
//		System.out.println(a+"  "+b);
		for(long i=a; i<b; i++){
			char[] shuffleChar =(i+"").toCharArray();
			long shuffleNum = Long.parseLong(new String(shuffleChar));
			for(int j=0; j<(i+"").length()-1; j++){
				shuffleChar = shuffle(shuffleChar);
				shuffleNum = Long.parseLong(new String(shuffleChar));
				if(shuffleNum > a && shuffleNum > i && shuffleNum <=b ){
//						System.out.print(" "+i);
//						System.out.println(" shuffle: "+shuffleNum);
						count++;
				}
			}
		}
//		System.out.println();
		System.out.print(count);
	}

}
