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.util.*;

public class DancingGoogler{

    public static void main(String[] args){
	Scanner scanner = new Scanner(System.in);
	scanner.nextLine();
	int count = 1;
	while(scanner.hasNextLine()){
	    String[] tokens = scanner.nextLine().split(" ");
	    int numContestants = Integer.parseInt(tokens[0]);
	    int numSuprises = Integer.parseInt(tokens[1]);
	    int minScore = Integer.parseInt(tokens[2]);
	    int[] scores = new int[numContestants];
	    for(int i = 0; i < scores.length; ++i){
		scores[i] = Integer.parseInt(tokens[i + 3]);
	    }
	    DancingGoogler d = new DancingGoogler(numSuprises, minScore, scores);
	    System.out.println("Case #" + count + ": " + d.getNumGooglersWithMinScore());
	    ++count;
	}
    }

    public DancingGoogler(int numSuprises, int minScore, int[] scores){
	this.numSuprises = numSuprises;
	this.minScore = minScore;
	this.scores = scores;
    }

    public int getNumGooglersWithMinScore(){
	int count = 0;
	for(int score : scores){
	    if(score == 0){
		if(minScore == 0){
		    ++count;
		}
		continue;
	    }
	    if(score == 29){
		++count;
		continue;
	    }
	    if(score % 3 == 0){
		int av = score / 3;
		if(av >= minScore){
		    ++count;
		}else{
		    if(numSuprises > 0 && av >= minScore -1){
			++count;
			--numSuprises;
		    }
		}
		continue;
	    }
	    int av = score / 3;
	    int av1 = (score / 3) + 1;
	    int diffav = score - av * 3;
	    int diffav1 = av1 * 3 - score;
	    if(numSuprises > 0){
		if(diffav == 2){
		    if(av1 >= minScore){
			++count;
			continue;
		    }else{
			if(av >= minScore ||  score - av*2 >= minScore){
			    ++count;
			    --numSuprises;
			    continue;
			}
		    }
		}else{
		    if(av >= minScore || score -av * 2 >= minScore){
			++count;
			continue;
		    }
		    if(av1 >= minScore){
			++count;
			--numSuprises;
			continue;
		    }
		}
	    }else{
		if(diffav == 2){
		    if(av1 >= minScore){
			++count;
			continue;
		    }
		}else{
		    if(av >= minScore || score - av*2 >= minScore){
			++count;
			continue;
		    }
		}
	    }
	}
	return count;
    }

    private int numContestants;
    private int numSuprises;
    private int minScore;
    private int[] scores;
}