import java.util.*;
import java.io.*;

public class DancingWithTheGooglers
{
    public DancingWithTheGooglers()
    {
        Scanner inFile = null;
        try
        {
            inFile = new Scanner(new File("inputB.txt"));
        }
        catch(Exception e)
        {
            System.out.println("Problem opening input file. Exiting...");
			System.exit(0);
        }
        int t = inFile.nextInt();
        
        int [] results = new int [t];
        DancingWithTheGooglersMax [] rnc = new DancingWithTheGooglersMax[t];
        
        int i, j;
        int [] scores;
        int s, p;
        for(i = 0; i < t; i++)
        {
            scores = new int [inFile.nextInt()];
            s = inFile.nextInt();
            p = inFile.nextInt();
            for(j = 0; j < scores.length; j++)
                scores[j] = inFile.nextInt();
            
            rnc[i] = new DancingWithTheGooglersMax(i, scores, s, p, results);
            rnc[i].start();
        }
        inFile.close();
        
        boolean done = false;
        
        while(!done)
        {
            done = true;
            for(i = 0; i < t; i++)
                if(rnc[i].isAlive())
                {
                    done = false;
                    break;
                }
        }
        
        PrintWriter outFile = null;
        try
        {
            outFile = new PrintWriter(new File("outputB.txt"));
        }
        catch(Exception e)
        {
            System.out.println("Problem opening output file. Exiting...");
			System.exit(0);
        }
        
        for(i = 0; i < results.length; i++)
            outFile.printf("Case #%d: %d\n", i+1, results[i]);
        outFile.close();
    }
    
    public static void main(String [] args)
    {
        new DancingWithTheGooglers();
    }
    
    private class DancingWithTheGooglersMax extends Thread
    {
        int id;
        int s, p;
        int [] results, scores;
        
        public DancingWithTheGooglersMax(int i, int [] aScores, int aS, int aP,int [] res)
        {
            id = i;
            s = aS;
            p = aP;
            results = res;
            scores = aScores;
        }
        
        public void run()
        {
            int a = 0, b = 0;
            
            if(p == 0)
                results[id] = scores.length;
            else if(p == 1)
            {
                int y;
                y = 3*p - 3;
                
                for(int i = 0; i < scores.length; i++)
                    if(scores[i] > y)
                        a++;
                    else if(scores[i] > 0)
                        b++;
                
                b = Math.min(b, s);
                results[id] = a+b;
            }
            else
            {
                int y, z;
                y = 3*p - 3;
                z = 3*p - 5;
                
                for(int i = 0; i < scores.length; i++)
                    if(scores[i] > y)
                        a++;
                    else if(scores[i] > z)
                        b++;
                
                b = Math.min(b, s);
                results[id] = a+b;
            }
        }
    }
}
/**
 * 
 */
package org.mikeyin;

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Scanner;

/**
 * @author yincrash
 *
 */
public class DancingWithGooglers
{

  /**
   * @param args
   */
  public static void main(String[] args)
  {

    try
    {
      Scanner file = new Scanner(new File(args[0]));
      int testCases = file.nextInt();
      file.nextLine();
      int currentCase = 1;
      final PrintStream ps = new PrintStream(new File("dancers.out"));
      while (currentCase <= testCases) {
        final int numGooglers = file.nextInt();
        final int numSurprises = file.nextInt();
        final int atLeastScore = file.nextInt();
        
        ArrayList<Integer> totalScores = new ArrayList<Integer>(numGooglers);
        
        for (int i = 0; i < numGooglers; i++) {
          totalScores.add(file.nextInt());
        }
        
        ps.append("Case #").print(currentCase);
        ps.append(": ");

        ps.println(getMaxPossibleWithAtLeastScore(totalScores, numSurprises, atLeastScore));
        
        currentCase++;
      }
    } catch (FileNotFoundException e)
    {
      e.printStackTrace();
    }
  }

  private static int getMaxPossibleWithAtLeastScore(
      ArrayList<Integer> totalScores, int numSurprises, int atLeastScore)
  {
    int maxPossible = 0;
    for (int score : totalScores) {
      int mean = score / 3;
      int remainder = score % 3;
      
      switch (remainder) {
        case 2:
          if (mean + 1 >= atLeastScore) {
            maxPossible++;
          }
          else if (numSurprises > 0 && mean + 2 >= atLeastScore) {
            numSurprises--;
            maxPossible++;
          }
          break;
        case 1:
          if (mean + 1 >= atLeastScore) {
            maxPossible++;
          }
          break;
        case 0:
          if (mean >= atLeastScore)
            maxPossible++;
          else if (numSurprises > 0 && mean != 0 && mean + 1 >= atLeastScore) {
            numSurprises--;
            maxPossible++;
          }
          break;
      }
    }
    
    return maxPossible;
  }

}
