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 RecycledNumbers {
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int t = scanner.nextInt();
		for (int x = 0; x < t; x++) {
			int a = scanner.nextInt();
			int b = scanner.nextInt();
			int y = RecycledNumbers.recycledCount(a, b);
			System.out.printf("Case #%d: %d%n", x + 1, y);
		}
		scanner.close();
	}

	public static int recycledCount(int n1, int n2) {
		int recycled = 0;

		for (int x = n1; x <= n2; x++) {
			String s = String.valueOf(x);
			for (int i = 0; i < s.length() - 1; i++) {
				String s2 = s.substring(i + 1) + s.substring(0, i + 1);
				int x2 = Integer.parseInt(s2);
				if (x2 >= n1 && x2 <= n2 && x2 > x) {
					recycled++;
				}
			}
		}
		return recycled;
	}
}
