
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;
import java.io.File;
import java.io.IOException;
import java.io.FileWriter;
import java.io.BufferedWriter;

public class Recycle
{
	public static void main(String[] args)
	{
/*		Set<Integer> perms = getPermutations(123456);
		
		for(Integer i: perms)
			System.out.println(i);*/
	
		try
		{
			Scanner s = new Scanner(new File("recycle.in"));
			BufferedWriter w = new BufferedWriter(new FileWriter(new File("recycle.out")));
			int numCases = s.nextInt();
			s.nextLine();
			
			for(int n = 1;n <= numCases; n++)
			{
				int A = s.nextInt();
				int B = s.nextInt();
				int count = 0;
				for(int k = A; k <= B; k++)
				{
					count += getNumPairs(k, B);
				}
				
				w.write("Case #" + n + ": " + count + "\n");
			}
			
			w.flush();
			w.close();
		}
		catch (IOException e)
		{
			e.printStackTrace();
		}
	}
	
	public static int getNumPairs(int n, int B)
	{
		Set<Integer> possibles = getPermutations(n);
		int count = 0;
		for(Integer i : possibles)
			if(i > n && i <= B)
				count++;
		return count;
	}
	
	public static Set<Integer> getPermutations(int n)
	{
		Set<Integer> perms = new TreeSet<Integer>();
		char[] digits = String.valueOf(n).toCharArray();
		
		for(int firstPos = 1; firstPos < digits.length; firstPos++)
		{
			String toBuild = "";
			for(int k = 0; k < digits.length; k++)
				toBuild += digits[(firstPos + k) % digits.length];
			perms.add(Integer.parseInt(toBuild));
		}
		return perms;
	}
	

}
package cjam.c;

import java.awt.Checkbox;
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashMap;

public class Program {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		
		 java.io.BufferedReader stdin = new java.io.BufferedReader(new java.io.InputStreamReader(System.in));
	      
	       try {
			int n = Integer.parseInt(stdin.readLine());
			 ArrayList<String> l = new ArrayList<String>();
			for (int i = 0; i < n; ++i){
				String[] spt = stdin.readLine().split(" ");
				int a = Integer.parseInt(spt[0]);
				int b = Integer.parseInt(spt[1]);
				
				int res = 0;
				for (int j = a; j <= b; ++j){
					for (int k = j+1; k <= b; ++k){
						if (check(j,k)){ res++;
//						check(j,k);
//						if (j == 178) {
//							int asd = 123;
//							check(j,k);
//							asd++;
//						}
//						System.out.println(j+" "+k);
						}
					}
				}
				l.add("Case #"+(i+1)+": "+res);
				
			}
			for (String s : l) {
		    	   System.out.println(s);
		       }
		} catch (NumberFormatException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}

	}

	static boolean check(int a, int b){
		
		if (b <= a) return false;
		int x = 10;
		int n = 1;
		while (a/x > 0){
			n++;
			x *= 10;
		}

		//System.out.println(n);
		for (int i = 1; i < n; ++i){
			int c = a % pow(10,i);
			int f = pow(10,(n-i))*c;
			int g = a / pow(10,i);
			if ( f+g  == b) return true;
		}
		
		return false;
	}
	static int pow (int x, int n){
		int y = x;
		for (int i =0; i<n-1; ++i) y*=x;
		return y;
	}
}
