/**
 * 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.util.Scanner;
import java.lang.Math;

class q2{
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		Score s = new Score();

		int size = new Integer(sc.nextLine());

		int j = 1;

		while(sc.hasNextLine() && size > 0){
			String str = sc.nextLine();
			String[] tok = str.split(" ");
			int nGooglers = new Integer(tok[0]);
			int sTrips = new Integer(tok[1]);
			int pScore = new Integer(tok[2]);
			int[] tPoints = new int[nGooglers];
			
			for(int i=3; i<nGooglers+3; ++i)
				tPoints[i-3] = new Integer(tok[i]);

			int best = s.in(nGooglers, sTrips, pScore, tPoints);
			
			System.out.println("Case #" + j + ": " + best);
			++j;
			--size;
		}
	}
}

class Score{

	public int in(int n, int s, int p, int[] t){
		int moreThanp = 0;
		for(int i=0; i<n; ++i){
			int ave = (int)Math.ceil(t[i]/3.00);
			int r = t[i]%3;
			
			if(ave >= p)
				++moreThanp;
			else if(s>0 && (r == 0 || r == 2) && t[i]>1){
				++ave;
				if(ave >= p){
					++moreThanp;
					--s;
				}
			}
		}
		
		return moreThanp;
	}
}


