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.Scanner;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
/**
 *
 * @author dave
 */
public class Main {

    public static void main(String g[]) {
        char map[] = new char[300];

        Scanner sc = new Scanner(System.in);
        int t = Integer.parseInt(sc.next());
        int k = 1;
        while (t > 0) {
            t--;
            int n = Integer.parseInt(sc.next());

            int s = Integer.parseInt(sc.next());
            int b = Integer.parseInt(sc.next());
            int list[] = new int[35]; // scores

            int initialCount = 0;

            int i = 0; // googler index
            while (n > 0) {
                n--;
                int score = Integer.parseInt(sc.next());
                int minVal = b + 2 * (b - 2);
                if(minVal<0)
                    minVal=b;
                int specialNumber = (3 * b - 3);
                if(specialNumber<0)
                {
                    specialNumber=0;
                    
                }
                
                //System.out.println("score = "+score);
                //System.out.println("minVal = "+minVal);
                if (score < minVal) 
                {
                    //System.out.println("SKIP");
                    continue;
                }

                initialCount++;

                if (score <= specialNumber  ) {
                    if (s > 0 && score>=2 && score<=28) {
                        //System.out.println("using special for :" + score);
                        s--;
                    } 
                    else 
                    {
                        //System.out.println("required but cannot use!");
                        initialCount--;
                    }
                    
                    if(score<2)
                        initialCount++;
                }



            }


            System.out.println("Case #" + (k++) + ": " + initialCount);

        }

    }
}
