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.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.File;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintStream;
import java.util.HashSet;
import java.util.Set;


public class Recycle {
	
	public static void main(String[] args) throws IOException {
		long time = System.currentTimeMillis();
		File iFile = new File("A-large-practice.in");
		BufferedReader in= new BufferedReader(new FileReader(iFile));
		
		File oFile = new File("A-large-practice.out");
		FileOutputStream fos = new FileOutputStream(oFile);
		BufferedOutputStream bos = new BufferedOutputStream(fos);
		PrintStream out = new PrintStream(bos);
			
		int numCases = Integer.parseInt(in.readLine());
		
		for(int i=0; i<numCases; i++){
			String[] inputString = in.readLine().split(" ");
			int A = Integer.parseInt(inputString[0]);
			int B = Integer.parseInt(inputString[1]);
			
			int result = recycle(A, B);
			
			System.out.println("Case #"+(i+1)+": "+result);
			out.println("Case #"+(i+1)+": "+result);
		}
		
		
		long duration = System.currentTimeMillis() - time;
		System.out.println(duration+"ms taken");
		out.close();
	}
	
	private static int recycle(int A, int B){
		int result = 0;
		
		for(int i=A; i<B; i++){
			result += recycleNumber(i, B);
		}
		return result;
	}
	
	private static int recycleNumber(int i, int B){
		String iRep = Integer.toString(i);

		Set<String> possibleMs = new HashSet<String>();
		for(int rotate=1; rotate<iRep.length(); rotate++){
			String thisRot = iRep.substring(rotate)+ iRep.substring(0, rotate);
			int thisNum = Integer.parseInt(thisRot);
			if(thisNum > i && thisNum<=B){
				possibleMs.add(thisRot);
			}
		}
		
		return possibleMs.size();
	}
}