import java.util.*;
import java.io.*;

public class recycled_numbers {
	public static void main(String[]a) throws Exception{
		
		Scanner f = new Scanner(new File(a[0]));
		int result=0;
		int A,B;
		String n,m;
		HashSet<String> s=new HashSet<String>();
		
		int T=f.nextInt();	//T total case count
		for (int t=1; t<=T;t++){//for each case t
			
			s.clear();
			result=0;				//reset
			A=f.nextInt();B=f.nextInt();	//get values for next case
			
			if (A==B)result=0;//remove case not meeting problem limits 
			else{
				for(int i=A;i<=B;i++){//for each int in range
					n=Integer.toString(i);
					m=new String(n);
					//System.out.println(n);
					for (int j=1;j<n.length();j++){//move each digit to the front & test
						m = m.substring(m.length()-1)+m.substring(0,m.length()-1);
						if(m.matches("^0+[\\d]+")!=true &&
								Integer.parseInt(m)<=B &&
								Integer.parseInt(n)<Integer.parseInt(m)){
							s.add(new String(n+","+m));
							//result++;
							//System.out.println(" matched: "+m);
						}
						
					}
				}
				result = s.size();
			}

			//display output
			System.out.println("Case #" + t + ": " + result);
		}
	}
}
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
public class CodeJam {
	public static void main(String args[]){
		try {
			FileReader f = new FileReader("C-large.in");
			BufferedReader in = new BufferedReader(f);
			FileWriter fwrite = new FileWriter("output");
			BufferedWriter out = new BufferedWriter(fwrite);
			int n = Integer.parseInt(in.readLine().toString());
			int i =0;
			int count = 0;
			int a;
			int b;
			String line;
			while(i<n){
				out.write("Case #"+(i+1)+": ");
				line = in.readLine();
				a = Integer.parseInt(line.substring(0,line.indexOf(" ")));
				line = line.substring(line.indexOf(" ")+1);
				b= Integer.parseInt(line.substring(0,line.length()));
				count = 0;
//				System.out.println(a+" "+b);
				count = answer(a,b);
				out.write(String.valueOf(count));
				out.newLine();
				i++;
			}
			in.close();
			out.close();
			
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		}
		
	}
	private static int shift(int a, int n){
		String temp = String.valueOf(a);
		char c[]= new char[temp.length()];
		int j=0;
		while(j<n){
			for (int i = 0 ; i< temp.length();i++){
				c[i]= temp.charAt((temp.length()+i-1)%temp.length());
			}
			temp = String.valueOf(c);
			j++;
		}
		return Integer.parseInt(temp);
	}
	private static int answer(int a, int b) {
		int n =a;
		int count = 0;
		shift(a,3);
		while(n<=b){
			count += check(n,a,b);
			n++;
		}
		return count;
	}
	private static int check(int n, int a, int b) {
		int digit = String.valueOf(a).length();
		int temp = 0;
		int res = 0;
		int flag = 0;
		int ar[] = new int[digit];
		for(int i = 0; i<digit ; i++){
			temp = shift(n,i);
			ar[i]=temp;

			if(temp>= a && temp>n && temp <= b ){
				for(int z=0;z<i;z++){
					if(temp == ar[z]){
						flag = 1;
					}
				}
				if(flag == 0)
					res ++;
			}
		}
		return res;
	}
}