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

// library In.java at http://introcs.cs.princeton.edu/stdlib/stdlib.jar

public class PB {
    public static void main (String[] args) {
        int t, n, s, p;
        
        int num, mod, quot;
        int maybe;
        int counter;
        int max;
        
        In in = new In("input.txt");
        t = Integer.parseInt(in.readLine());
        
        int i = 1;
        // get input
        while (in.hasNextLine()) {
            maybe = 0;
            counter = 0;
            n = in.readInt();
            s = in.readInt();
            p = in.readInt();
            
            for (int j = 0; j < n; j++) {
                num = in.readInt();
                quot = num / 3;
                mod = num % 3;

                if (mod == 1) {
                    if (quot + 1 >= p) {
                        counter++;
                        continue;
                    }
                    if (3 * p - 2 <= num) {
                        maybe++;
                        continue;
                    }
                }
                if (mod == 0){ 
                    if (quot >= p) {
                        counter++;
                        continue;
                    }
                    if (3 * p - 3 <= num && num != 0) {
                        maybe++;
                        continue;
                    }
                }
                if (mod == 2) {
                    if (quot + 1 >= p) {
                        counter++;
                        continue;
                    }
                    if (3 * p - 4 <= num) {
                        maybe++;
                        continue;
                    }
                }
            }
            max = Math.min(s, maybe);
            
            System.out.print("Case #" + i + ": " + (max + counter) + "\n");
            i++;
        }
    }
}
