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.util.Scanner;

public class Recyclers {

	private static int countRecycled(int a, int b) {
		int recycled = 0;
		for (int i = a; i <= b; i++) {
			String s = new Integer(i).toString();
			for (int j = 0; j < s.length() - 1; j++) {
				String o = s.substring(s.length() - j - 1, s.length()).concat(
						s.substring(0, s.length() - j - 1));
				int n = Integer.valueOf(s);
				int m = Integer.valueOf(o);
				if (n < m && m <= b) {
					recycled++;
				}
			}
		}
		return recycled;
	}

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int cases = sc.nextInt();
		for (int x = 0; x < cases; x++) {
			sc.nextLine();
			int a = sc.nextInt();
			int b = sc.nextInt();
			int c = countRecycled(a, b);
			System.out.println("Case #" + (x + 1) + ": " + c);
		}
	}
}
