import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

import java.io.File;
import java.io.FileNotFoundException;
import java.util.HashSet;
import java.util.Scanner;


public class RecycledNumbers 
{
	static HashSet<String> set;
	public static int solve(int A, int B)
	{
		int count = 0;
		for(int n = A; n < B;n++)
		{
			String temp = n+"";
			int len = temp.length();
			for(int j = 0;j < len-1;j++)
			{
				temp = temp.charAt(len-1)+temp.substring(0,len-1);
				
				int m = Integer.parseInt(temp);
				if(set.contains(""+m))
					continue;
				if(m > n && m <= B)
					count++;
					
				set.add(""+m);
			}
			set.clear();
			
		}
		return count;
	}
	public static void main(String[] args) 
	{
		set = new HashSet<String>();
		Scanner sc = null;
		try {
			sc = new Scanner(new File("C:\\Users\\oibe\\Desktop\\C-small-attempt1.in"));
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}
		
		int numCases = Integer.parseInt(sc.nextLine());
		for(int i = 1; i <= numCases;i++)
		{
			String[] vals = sc.nextLine().split(" ");
			int A = Integer.parseInt(vals[0]);
			int B = Integer.parseInt(vals[1]);
			System.out.println("Case #"+i+": "+solve(A,B));
		}
	}

}
