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

}
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author ZAMAN
 */
import java.io.*;

public class test {

    public static void main(String args[]) {
        try {
            BufferedReader a = new BufferedReader(new FileReader("B-large.in"));
            BufferedWriter b = new BufferedWriter(new FileWriter("B-large.out"));

            int Case = Integer.parseInt(a.readLine());
            for (int i = 1; i <= Case; i++) {
                String line[] = a.readLine().split(" ");
                int c[] = new int[line.length];
                b.append("Case #);" + i + ": ");
                for (int j = 0; j <= line.length - 1; j++) {
                    c[j] = Integer.parseInt(line[j]);

                }
                int contestants = c[0];
                int suprise = c[1];
                int margin = c[2];
                int best = 0;
                if (suprise == 0) {
                    for (int j = 0; j < contestants; j++) {
                        if (c[j + 3] % 3 == 0) {
                            if (c[j + 3] / 3 >= margin) {
                                best++;
                            }
                        } else if (c[j + 3] % 3 == 1 || c[j + 3] % 3 == 2) {
                            if (((c[j + 3] / 3) + 1) >= margin) {
                                best++;
                            }
                        }
                    }
                } else {
                    for (int j = 0, k = suprise; j < contestants; j++) {
                        int remain = c[j + 3] % 3;
                        int dv = c[j + 3] / 3;
                        if (remain == 0) {
                            if (dv >= margin) {
                                best++;
                            } else if (k > 0 && (dv + 1) >= margin && (dv + 1) <= c[j + 3]) {
                                best++;
                                k--;
                            }
                        } else if (remain == 1) {
                            if (((dv) + 1) >= margin && (dv + 1) <= c[j + 3]) {
                                best++;
                            }

                        } else if (remain == 2) {

                            if (((dv) + 1) >= margin && (dv + 1) <= c[j + 3]) {
                                best++;
                            } else if (k > 0 && (dv + 2) >= margin && (dv + 1) <= c[j + 3]) {
                                best++;
                                k--;
                            }
                        }
                    }

                }
                b.append("" + best);
                b.newLine();
            }
            b.flush();
            a.close();
            b.close();

        } catch (Exception e) {
            e.printStackTrace();
        }
    }
}