/**
 * Created by IntelliJ IDEA.
 * User: Administrator
 * Date: 3/3/12
 * Time: 11:00 AM
 * To change this template use File | Settings | File Templates.
 */

import SRMLib.MathLibrary;
import SRMLib.TestSRMLib;
import com.sun.org.apache.bcel.internal.generic.F2D;

import java.io.*;
import java.util.*;
import java.util.zip.Inflater;

public class SRM {
    public static void main(String[] args) throws IOException {
        //TestSRMLib.run();
        codeJam1.main();

        return;
    }
}
class codeJam1 {
    public static void main() throws IOException {
        String inputPath = "E:\\input.txt";
        String outputPath = "E:\\output.txt";
        BufferedReader input = new BufferedReader(new FileReader(inputPath));
        BufferedWriter output = new BufferedWriter(new FileWriter(outputPath));

        String line;
        line = input.readLine();
        int T = Integer.parseInt(line);
        for (int i = 1; i <= T; ++i) {
            line = input.readLine();
            String[] words = line.split(" ");
            int N = Integer.parseInt(words[0]);
            int S = Integer.parseInt(words[1]);
            int p = Integer.parseInt(words[2]);
            int n = 0;
            int res = 0;

            for (int j = 3; j < words.length; ++j) {
                if (p == 0) {
                    res++;
                    continue;
                }

                int t = Integer.parseInt(words[j]);
                if (p == 1) {
                    if (t > 0)
                        res++;
                    continue;
                }
                if (t >= 3 * p - 2)
                    res++;
                else if (t >= 3 * p - 4)
                    n++;
            }

            res += Math.min(n, S);
            output.write("Case #" + i + ": " + res);
            output.newLine();
        }

        input.close();
        output.close();
    }
}

import java.io.BufferedWriter;
import java.io.FileWriter;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Scanner;

public class GCJ3 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] hold = new int[n];
		for (int i = 0; i < n; i++) {
			hold[i] = 0;
			int a = sc.nextInt();
			int b = sc.nextInt();
			int k = (int) Math.log10(a);
			HashSet<Integer> checked = new HashSet<Integer>();
			for (int j = a; j <= b; j++) {
				if(checked.contains(j))
					continue;
				HashSet<Integer> set = new HashSet<Integer>();
				set.add(j);
				int curr = j;
				for (int l = 0; l <= k; l++) {
					int firstDig = curr / (int) Math.pow(10, k);
					int mod = curr % (int) Math.pow(10, k);
					curr = mod * 10 + firstDig;
					if ((int) Math.log10(curr) == k) {
						if (a<=curr && curr <=b) {
							set.add(curr);
						}
					}
				}
				if (set.size() > 1){
					Iterator<Integer> p = set.iterator();
					for(int m = 0;m<set.size();m++){
						int P = p.next();
						checked.add(P);
					}
					hold[i] += set.size() * (set.size() - 1) / 2;
				}
			}
		}
		try {
			// Create file
			FileWriter fstream = new FileWriter("out.txt");
			BufferedWriter out = new BufferedWriter(fstream);
			for (int i = 0; i < n; i++) {
				out.write("Case #" + (1 + i) + ": " + hold[i]);
				if (i < n - 1)
					out.write("\n");
			}
			out.close();
		} catch (Exception e) {// Catch exception if any
			System.err.println("Error: " + e.getMessage());
		}
	}
}
