
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;
	}
	

}

import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Map;
import java.util.TreeMap;
import java.util.Set;
import java.util.TreeSet;

class RecycledNumbers {

    private static int[] primeMap = new int[] {
        2, 3, 5, 7, 11, 13, 17, 19, 23, 29
    };

    public static void main(String[] args) 
        throws IOException {
        
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(reader.readLine());
        
        for (int i = 0; i < n; i++) {
            int counter = 0;
            String[] line = reader.readLine().split(" ");
            int down = Math.max(10, Integer.parseInt(line[0]));
            int up = Integer.parseInt(line[1]);
            int tren = down;
            while (tren < up) {
                int limit = Math.min(up, (int) Math.pow(10, Math.ceil(Math.log10(tren + .1))));
                Map<Long, Set<String>> numbers = new TreeMap<Long, Set<String>>();
                for (; tren <= limit; tren++) {
                    long hash = hash(tren);
                    if (!numbers.containsKey(hash)) { numbers.put(hash, new TreeSet<String>()); }
                    numbers.get(hash).add(Integer.toString(tren));
                }
                
                for (Long key : numbers.keySet()) {
                    String[] vals = numbers.get(key).toArray(new String[] { });
                    for (int j = 0; j < vals.length - 1; j++) {
                        for (int k = j + 1; k < vals.length; k++) {
                            String first = vals[j];
                            String second = vals[k] + vals[k];
                            if (second.indexOf(first) != -1) {
                                counter++;
                            }
                        }
                    }
                }
            }
            System.out.println("Case #" + (i + 1) + ": " + counter);
        }
        
    }
    
    private static long hash(int in) {
        long tmp = 1;
        while (in > 0) {
            tmp *= primeMap[in % 10];
            in /= 10;
        }
        return tmp;
    }

}