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.*;
import java.util.*;


public class RecyledNumbers {
	public static void main(String args[]) throws IOException{
	   	 Scanner scan=new Scanner(new File("C-large.in"));
	   	 PrintWriter pw=new PrintWriter(new File("result.txt"));
	   	 int caseNum=Integer.parseInt(scan.nextLine());
	   	 for(int i=1;i<=caseNum;i++){
	   		 String a=scan.nextLine();
	   		 //System.out.println(a);
	   		 int result=0;
	   		 String[] temp=new String[2];
	   		 temp=parseString(a);
	   		 //System.out.println(temp);
	   		 String A=temp[0];
	   		 String B=temp[1];
	   		 for(int j=Integer.parseInt(A);j<Integer.parseInt(B);j++){
	   			 String t=""+j;
	   			 result=result+judgeRecycle(t,B);
	   		 }
	   		 pw.println("Case #"+i+": "+result);
	   		 System.out.println("Case #"+i+": "+result);
	   	 }
	   	 pw.flush();
	   	 pw.close();
	    }
		
		public static String[] parseString(String s){
			String[] result=new String[2];
			for(int i=0;i<s.length();i++){
				if(s.charAt(i)==' ') {
					result[0]=s.substring(0, i);
					//System.out.println(result[0]);
					result[1]=s.substring(i+1, s.length());
					//System.out.println(result[1]);
					break;
				}
				if(i==s.length()-1) result[0]=s;
				result[1]=s.substring(i, s.length());
			}
			//System.out.println(result);
			return result;
		}
		
		public static int judgeRecycle(String toBeJudged, String B){
			
			List<Integer> movedNum=new ArrayList<Integer>();
			for(int i=1;i<toBeJudged.length();i++){
				int temp=Integer.parseInt(toBeJudged.substring(i, toBeJudged.length())+toBeJudged.substring(0, i));
				if(temp>Integer.parseInt(toBeJudged) && temp<=Integer.parseInt(B)) {
					if(!movedNum.contains(temp)) movedNum.add(temp);
					//System.out.println(toBeJudged+" "+temp);
				}
			}
			return movedNum.size();
		}
}
