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.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;


public class C {
public static void main(String args[]){
		
		try{
		
			BufferedReader br = new BufferedReader(new FileReader(args[0]));
			String strTmp = br.readLine();
			BufferedWriter bw = new BufferedWriter(new FileWriter( new File("output.txt"),false));
			
			
			int inputSize = Integer.parseInt(strTmp);
			
			
			for(int i=0;i<inputSize;i++  ){

				String[] line = br.readLine().split(" ");
				int pos = 0;
				// processing inputline
				
				int len = line[0].length();
				int min = Integer.parseInt(line[0]);
				int max = Integer.parseInt(line[1]);
				
				if(min<10){
					pos = 0;
				}else{
					
					for(int j=min ; j <= max ; j++ ){
				
						String st = Integer.toString(j);
						ArrayList<Integer> uniqList = new ArrayList<Integer>();
						for(int k=0;k<len-1;k++){
							char tmp = st.charAt(len-1);
							st = st.charAt(len-1) + st.substring(0,len-1);
							
							int i1 = Integer.parseInt(st);
							
							if(j<i1 && i1<=max && !uniqList.contains(i1) ){
								pos++;
								uniqList.add(i1);
							}
							
						}
					}
				}
				// produce output
                //System.out.println("Case #"+(i+1)+": " + pos );			
				bw.write("Case #"+(i+1)+": " + pos );
				bw.newLine();
			}
			
			bw.close();
			br.close();
		
		
		}catch(Exception ex){
			ex.printStackTrace();
		}
	}
}
