
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.File;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;

/**
 * @author Nikita Beloglazov
 *         Date: May 22, 2010
 */
public class Solution {

    private Map root;

    private int res;

    private void createDirectory(String[] dirs) {
        Map cur = root;
        for (String dir : dirs) {
            if (cur.get(dir) == null) {
                res++;
                cur.put(dir, new HashMap());
            }
            cur = (Map)cur.get(dir);
        }
    }

    private void solve() throws IOException {
        Scanner sc = new Scanner(new File("input.txt"));
        PrintWriter pw = new PrintWriter(new FileWriter("output.txt"));
        int tt = sc.nextInt();
        for (int t = 1; t <= tt; t++) {
            int n = sc.nextInt(), m = sc.nextInt();
            root = new HashMap();
            root.put("",new HashMap());
            for (int i = 0; i < n; i++) {
                createDirectory(sc.next().split("/"));
            }
            res = 0;
            for (int i = 0; i < m; i++) {
                createDirectory(sc.next().split("/"));
            }
            pw.printf("Case #%d: %d\n", t, res);
        }
        pw.close();
    }

    public static void main(String[] args) throws IOException {
        new Solution().solve();
    }
}
