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.DataInputStream;
import java.io.DataOutputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.util.HashSet;
import java.util.Scanner;


public class RecycledNumbers {		
	
	public static void main(String[] args) throws NumberFormatException, IOException {				
		FileInputStream inFile = new FileInputStream(new File("resources/codejam/RecycledNumbers.in"));			
		DataInputStream in = new DataInputStream(inFile);

		FileOutputStream outFile = new FileOutputStream(new File("resources/codejam/RecycledNumbers.out"));
		DataOutputStream out = new DataOutputStream(outFile);

		int cases = Integer.parseInt(in.readLine());
		
		for(int i=0;i<cases;i++) {
			doCase(i+1, in, out);
			if(i != cases - 1) {
				out.writeBytes("\n");
			}
		}
	}

	private static void doCase(int caseNo, DataInputStream in, DataOutputStream out) throws IOException {
		StringBuilder sb = new StringBuilder();
		sb.append("Case #");
		sb.append(caseNo);
		sb.append(": ");
		
		int recycles = 0;
		
		Scanner s = new Scanner(in.readLine());
		int a = s.nextInt();
		int b = s.nextInt();
		for(int i = a; i <= b; i++) {
			String numbers = String.valueOf(i);
			int len = numbers.length();
			if(len > 1) {								
				//check for recycles
				String firstStr = String.valueOf(numbers.charAt(0));
				int firstNo = Integer.parseInt(firstStr);
				HashSet<Integer> record = new HashSet<Integer>();
				for(int j = 1; j < len; j++) {
					int currNo = Integer.parseInt(String.valueOf(numbers.charAt(j)));
					if(currNo > firstNo || currNo == 0) {
						continue;
					}					
					String newNo = numbers.substring(j) + numbers.substring(0, j);  
																					
					Integer newVal = Integer.valueOf(newNo);
					if(newVal < i && newVal >= a) {												
						record.add(newVal);
					} 
				}	
				recycles+= record.size();
			}					
		}						
		sb.append(recycles);				
		out.writeBytes(sb.toString());
		
	}

	
}
