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

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

/**
 *
 * @author Abdelrahman
 */
import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;

public class CaseB {

    public static void main(String[] args) throws FileNotFoundException, IOException {
        File f1 = new File("E:\\new c++\\Google\\codejame 2011\\2012\\inputCodejame.txt");
        BufferedReader reader = new BufferedReader(new FileReader(f1));
        int count = Integer.parseInt(reader.readLine());
        for (int i = 0; i < count; i++) {
            String[] line = reader.readLine().split(" ");
            int n = Integer.parseInt(line[0]);
            int s = Integer.parseInt(line[1]);
            int p = Integer.parseInt(line[2]);
            int[] scores = new int[line.length - 3];
            int k = 0;
            for (int j = 3; j < line.length; j++) {
                scores[k++] = Integer.parseInt(line[j]);
            }
            int counter = 0;
            for (int j = 0; j < n; j++) {
                int score = scores[j];
                if (score == 0 || score == 30) {
                    if (score / 3 >= p) {
                        counter++;
                    }
                } else if (score % 3 == 0) {
                    if (score / 3 >= p) {
                        counter++;
                    } else if ((score / 3) + 1 >= p) {
                        if (s > 0) {
                            s--;
                            counter++;
                        }
                    }
                } else if (score % 3 == 1) {
                    if ((score / 3) + 1 >= p) {
                        counter++;
                    }
                }
                else if (score % 3 == 2) {
                    if ((score / 3)+1 >= p) {
                        counter++;
                    } else if ((score / 3) + 2 >= p) {
                        if (s > 0) {
                            s--;
                            counter++;
                        }
                    }
                }               
            }
            System.out.println("Case #" + (i + 1) + ": " + counter);
        }
    }
}