package com.silverduner.codejam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashMap;

public class Dancing {
	public static void main(String[] args) throws Exception {
		File input = new File("B-small-attempt0.in");
		BufferedReader in = new BufferedReader(new FileReader(input));

		File output = new File("1.out");
		BufferedWriter out = new BufferedWriter(new FileWriter(output));

		// parse input
		int N = Integer.parseInt(in.readLine());
		for(int i=0;i<N;i++) {
			String str = in.readLine();
			out.write("Case #"+(i+1)+": ");
			System.out.println("-------");
			String[] words = str.split(" ");
			int n = Integer.parseInt(words[0]);
			int suprise = Integer.parseInt(words[1]);
			int threshold = Integer.parseInt(words[2]);
			int[] scores = new int[n];
			for(int j=0;j<n;j++) {
				scores[j] = Integer.parseInt(words[3+j]);
			}
			int count = 0;
			for(int score : scores) {
				int a,b,c;
				boolean find = false;
				boolean sfind = false;
				for(a = 10; a>=0 && !find; a--) {
					if(3*a-4>score)
						continue;
					for(b = a; b>=0 && b >=a-2 && !find; b--) {
						for(c = b; c>=0 && c >=b-2 && c >=a-2 && !find; c--) {
							System.out.println(a+","+b+","+c);
							if(a+b+c==score) {
								if(a >= threshold) {
									if(a-c <= 1){
										count++;
										find = true;
										System.out.println("find!");
									}
									else if(a-c == 2){
										sfind = true;
										System.out.println("suprise!");
									}
								}
							}
							
						}
					}
				}
				if(!find && sfind && suprise > 0)
				{
					count++;
					suprise --;
				}
			}
			int maxCount = count;
			out.write(maxCount+"\n");
		}
		out.flush();
		out.close();
		in.close();
	}
}


import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Scanner;

public class PB {

    public static void main(String[] args) throws FileNotFoundException {
        if (args.length != 1) {
            System.exit(1);
        }
        File inFile = new File(args[0]);
        Scanner sc = new Scanner(inFile);
        int T = sc.nextInt();
        try (PrintWriter out = new PrintWriter("out.txt")) {
            for (int i = 0; i < T; i++) {
                int N = sc.nextInt();
                int S = sc.nextInt();
                int p = sc.nextInt();
                int[] t = new int[N];
                for (int j = 0; j < N; j++) {
                    t[j] = sc.nextInt();
                }
                int[][] scores = new int[N][3];
                for (int j = 0; j < N; j++) {
                    scores[j][0] = t[j] / 3;
                    scores[j][1] = (t[j] - scores[j][0]) / 2;
                    scores[j][2] = t[j] - scores[j][0] - scores[j][1];
                }
                int count = 0;
                for (int j = 0; j < N; j++) {
                    boolean isSurprise = false;
                    if (scores[j][2] - scores[j][0] == 2) {
                        S--;
                        isSurprise = true;
                    }
                    if (scores[j][2] >= p) {
                        count++;
                    } else {
                        if (S > 0 && !isSurprise && (p - scores[j][2]) == 1 && scores[j][1] > 0) {
                            S--;
                            scores[j][1]--;
                            scores[j][2]++;
                            count++;
                        }
                    }
                }
                out.println("Case #" + (i + 1) + ": " + count);
            }
        }
        System.out.println("Completed");
    }
}
