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

class Dancing
{
  public static void main(String... args)
  {
    Scanner sc = new Scanner(System.in);
    int tests = sc.nextInt();
    for (int test = 1; test <= tests; test++)
    {
      int n = sc.nextInt();
      int s = sc.nextInt();
      int p = sc.nextInt();
      List<Integer> scores = new ArrayList<Integer>(n);
      for (int i = 0; i < n; i++)
      {
        scores.add(sc.nextInt());
      }
      int result = solve(n, s, p, scores);
      System.out.println("Case #" + test + ": " + result);
    }
  }

  public static int solve(int n, int s, int p, List<Integer> scores)
  {
    java.util.Collections.sort(scores);
    java.util.Collections.reverse(scores);
    int result = 0;
    for (Integer score : scores)
    {
      int avg = score / 3;
      if (avg >= p)
      {
        result++;
        continue;
      }
      if (score - (avg * 3) > 0 && avg + 1 >= p)
      {
        result++;
        continue;
      }
      // need a surprising result
      if (score < 2 || score > 28)
      {
        // suprising results impossible here
        continue;
      }
      if (score - (avg * 3) == 2 && avg + 2 >= p && s > 0)
      {
        result++;
        s--;
        continue;
      }
      if (score - (avg * 3) == 0 && avg + 1 >= p && s > 0)
      {
        result++;
        s--;
        continue;
      }
    }
    return result;
  }
}
