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.File;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class C {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(new File("d:\\cc.large.in"));// new Scanner(new
																// File("d:\\b.small.in"));
		// in = new Scanner(new File("d:\\Minimum Scalar Product-big.in"));

		int testCases = in.nextInt();
		in.nextLine();
		for (int cas = 1; cas <= testCases; cas++) {
			int ans = 0;
			int A = in.nextInt();
			int B = in.nextInt();
			// in.nextLine();

			Map<Integer, Set<Integer>> map = new HashMap<Integer, Set<Integer>>();

			for (int n = A; n < B; n++) {
				String sn = "" + n;
				int len = sn.length();
				for (int i = 1; i < len; i++) {
					String front = sn.substring(0, i);
					String rear = sn.substring(i, len);
					int m = Integer.parseInt(rear + front);

					if (A <= n && n < m && m <= B) {
						Set<Integer> s = map.get(n);
						if (null == s) {
							ans++;
							s = new HashSet<Integer>();
							s.add(m);
							map.put(n, s);
						} else {
							if (s.add(m))
								ans++;
						}
						// System.err.printf("n:%d,m:%d\n",n,m);
					}
				}
			}

			System.out.printf("Case #%d: %d\n", cas, ans);
		}

	}

}
