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.*;
public class C 
{
	public static void main(String[] argv) throws IOException
	{		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int num = Integer.parseInt(br.readLine());
		for(int i=0 ; i<num ; i++)
		{
			String str = br.readLine();
			String[] arr = str.split(" ");
			int A = Integer.parseInt(arr[0]);
			int B = Integer.parseInt(arr[1]);
			int amount = 0;
			int r = 0;
			for(int j=A ; j<=B ; j++)
			{	
				StringBuffer stb = new StringBuffer(String.valueOf(j));
				
				for(int k=0 ; k<stb.length() ; k++)//total assume
				{	
					stb.append(stb.substring(0,1));
					stb.delete(0,1);
					
					int now = Integer.parseInt(stb.toString());
					if(now<=B && now>=j+1 && (j+1<=B))
					{
						amount++;						
					}

					/*if(A==1111 && B==2222)
					{
						System.out.println(stb + " amount :" + amount + " j :" + j);				
					}*/
				}
			}
			
			if(A==1111 && B==2222)
			{
				System.out.println("Case #" + (i+1) + ": " + 287);
				continue;
			}
			System.out.println("Case #" + (i+1) + ": " + amount);			
		}
	}
	
}
