import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;


public class Main {

//	static int MAX = 10000;
	static int MAX = 2000000;
	static Object[] All = new Object[MAX+1];
	
	static int size( int x ) {
		if(x>999999) return 7;
		if(x>99999)  return 6;
		if(x>9999)   return 5;
		if(x>999)    return 4;
		if(x>99)     return 3;
		if(x>9)      return 2;
		return 1;
	}
	static int[] rotate( int value ) {
		List<Integer> result = new ArrayList<Integer>();
		int[] V = new int[8];
		int s = size(value);
		int x = value;
		
		for(int i=s-1;i>=0;i--) {
			V[i] = x%10;
			x /=10;
		}
		int rot;
		for(int i=1; i<s; i++) {
			if(V[i]!=0){
				rot=0;
				for(int j=0,ii=i;j<s; j++,ii=(ii+1)%s){
					rot=rot*10+V[ii];
				}
				if(rot>value && !result.contains(rot))
					result.add(rot);
			}
		}
		if( result.isEmpty() )
			return null;
		int[] r = new int[result.size()];
		for(int i=0; i<r.length; i++)
			r[i]=result.get(i);
		return r;
	}
	
	static void precalculate() {
		for(int i=1; i<=MAX; i++){
			All[i] = rotate(i);
		}
	}
	static int solve( Scanner in ) {
		int A, B, sol=0;
		
		A = in.nextInt();
		B = in.nextInt();

		for( int i=A; i<=B; i++) {
//			List<Integer> result = rotate(i);
			if( All[i]!=null ) {
				for(int value: (int[])All[i] ) {
					if( value <= B )
						sol++;
				}
			}
		}

		return sol;
	}
	
	public static void main ( String args[] ) {
		int T; 
		Scanner in = new Scanner(System.in);
		T = in.nextInt();
		int cnt=0;
		int sol;
		precalculate();
		for( cnt=1; cnt<=T; cnt++ ) {
			sol = solve( in );
			System.out.printf("Case #%d: %d\n", cnt, sol);
		}

	}
}

import java.io.*;
import java.util.HashMap;
public class RecycledNumbers {
	
	public static void main(String[] arg) {
		String output,line = null;
		int t,a,b, count, caseNum;
		String[] inp; 
		
		try {
			BufferedReader is = new BufferedReader(new FileReader("infile.txt"));
			FileWriter writer = new FileWriter("output.txt");
			line = is.readLine();
			t = Integer.parseInt(line);
			for(caseNum=1; caseNum<=t; caseNum++) {
				line = is.readLine();
				inp = line.split(" ");
				
				a = Integer.parseInt(inp[0].trim());
				b = Integer.parseInt(inp[1].trim());
				
				count = generateRotatedNumbersCount(a, b);
				output = "Case #" + caseNum + ": " + count + "\n";
				writer.write(output.toCharArray());
			}
			writer.close();
		} catch (NumberFormatException ex) {
			System.out.println("Not a valid number: " + line);
		} catch (IOException e) {
			System.out.println("Unexpected IO ERROR: " + e);
		}
	}
	
	public static int generateRotatedNumbersCount(int a, int b) { 
		HashMap<Integer, Boolean> map;
		HashMap<Integer, Boolean> masterList = new HashMap<Integer, Boolean>();
		String num;
		char[] temp;
		int i,j,k,len;
		int n, count=0;
		
		for (k=a; k<=b; k++) {
			if (masterList.containsKey(k))
				continue;
			num = Integer.toString(k);
			char[] digits = num.toCharArray();
			
			len = digits.length;
			
			map = new HashMap<Integer, Boolean>();
			for (i=0; i<len; i++) {
				temp = new char[len];
				for (j=0; j<len; j++) {
					if (i+j<len)
						temp[j] = digits[i + j];
					else
						temp[j] = digits[i + j - len];
				}
				
				n = Integer.parseInt(new String(temp));
				if (n >= a && n <= b) {
					
					map.put(n, true);
					masterList.put(n, true);
				}
			}
			len = map.size();
			count += (len*(len-1))/2;
		}
		return count;
	}
}