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

public class GoogleDancer {
	public static void main(String[] args) throws IOException
	{
		Scanner sc = new Scanner(new FileReader("Dancer.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("Dancer.out"), true);
		int T = sc.nextInt();
		for (int c = 1; c<=T; c++)
		{
			int N = sc.nextInt();
			int S = sc.nextInt();
			int p = sc.nextInt();
			int[] points = new int[N];
			for (int d = 0; d < N; d++)
			{
				points[d] = sc.nextInt();
			}
			int num = calc(N, S, p, points);
			String x = String.format("Case #%d: %d", c, num);
			pw.println(x);
		}
		
		
		pw.close();
	}
	public static int calc(int N, int S, int p, int[] points)
	{
		int total = 0;
		int min = ((p-2)<0? 0 : p-2)*2 + p;
		for (Integer n : points)
		{
			
			if (n < min) continue;
			int avg = n/3;
			if (n%3 == 0)
			{
				if (avg >= p) total++;
				else if ((avg+1) >= p && S>0)
				{
					total++;
					S--;
				}
			}else if (n%3 == 1)
			{
				if ((avg+1) >= p)total++;
			}else
			{
				if ((avg+1) >= p) total++;
				else if ((avg+2)>= p && S > 0)
				{
					total++;
					S--;
				}
			}
		}
		return total;
	}
}
