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.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.util.TreeSet;


public class prob2 {
	private static long oneTest(int a, int b){
		boolean [] bool=new boolean[b+1];
		long res=0;
		for(int i=a; i<=b; i++){
			if(bool[i]) continue;
			res+=pairs(i, bool, a, b);
		}
		return res;
	}
	private static long pairs(int j, boolean []bool, int a, int b){
		String str=Integer.toString(j);
		int len=str.length();
		TreeSet<Integer> set=new TreeSet<Integer>();
		for(int i=0; i<=str.length(); i++){
			int c=Integer.parseInt(str);
			if(Integer.toString(c).length()!=len||(c<a||c>b)) {
				str=str.substring(len-1)+str.substring(0,len-1);
				continue;
			}
			str=str.substring(len-1)+str.substring(0,len-1);
			bool[c]=true;
			set.add(c);
			
		}
		long res=set.size();
		res*=(set.size()-1);
		res/=2;
		return res;
	}
	public static void main(String args[]) throws IOException{
		PrintWriter out=new PrintWriter(new FileWriter("result.txt"));
		BufferedReader in=new BufferedReader(new FileReader("C-large.in"));
		//BufferedReader in=new BufferedReader(new InputStreamReader(System.in));
	//	System.out.print(oneTest(10, 40));
		int n=Integer.parseInt(in.readLine());
		for(int i=1; i<=n; i++){
			String str=in.readLine();
			out.print("Case #"+i+": ");
			StringTokenizer tok=new StringTokenizer(str);
			out.print(oneTest(Integer.parseInt(tok.nextToken()), Integer.parseInt(tok.nextToken())));
			out.println();
			System.out.println(i);
		}
		
		out.flush();
		System.out.println("over");
		
	}
}
