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.BufferedReader;
import java.io.FileReader;

public class DG {

    public static void main (String[] args) throws Exception
    {

		BufferedReader sr = new BufferedReader(new FileReader("c:\\Projects\\DG.txt"));

		int total = Integer.parseInt(sr.readLine());

        for (int i=0; i<total; i++)
        {
            String[] tokens = sr.readLine().split(" ");
            int N = Integer.parseInt (tokens[0]);
            int S = Integer.parseInt (tokens[1]);
            int p = Integer.parseInt (tokens[2]);

            int[] scores = new int[N];
            for (int j=0; j<N; j++)
                scores[j] = Integer.parseInt (tokens[j+3]);

            solve (i+1, S, p, scores);
        }
    }


    private static void solve (int c, int S, int p, int[] scores)
    {
        int remaining = S;
        int total = 0;
        for (int i=0; i<scores.length; i++)
        {
            int base = scores[i] / 3;
            int add  = scores[i] % 3;

            if (add == 2)
            {
                
                if ((base+1)>=p)
                    total++;
                else
                {
					//it could be a surprising one
                    if ((base+2)>=p &&
                        remaining >0)
                    {
                        total++;
                        remaining--;
                    }
                }
            }
            else
                if (add == 0)
                {
                    if (base >= p)
                        total++;
                    else
                    {
						//it could be surprising as well
                        if ((base+1) >= p &&
                            remaining > 0 &&
                            base > 0)
                        {
                            total++;
                            remaining--;
                        }
                    }
                }
                    else
                    {
                        if ((base+add)>=p)
                            total++;
                    }
        }

        System.out.printf ("Case #%d: %d\n", c, total);
    }
}
