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;
            }
        }
    }
}
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.Writer;
import java.util.Scanner;

public class Main {

  public static void main (String[] args) throws IOException {
    Writer writer = new FileWriter("/home/a/dev/codejam-2012/B-submit.txt");
    Scanner scanner = new Scanner(new File("/home/a/dev/codejam-2012/A-dev.txt"));
    int n_cases = scanner.nextInt();
    scanner.nextLine();
    for (int i = 0; i < n_cases; ++i) {
      int N = scanner.nextInt();
      int S = scanner.nextInt();
      int p = scanner.nextInt();
      int [] scores = new int[N];
      for (int j = 0; j < scores.length; ++j) {
        scores[j] = scanner.nextInt();
      }
      Main main = new Main();
      writer.write("Case #" + (i + 1) + ": " + main.solve(S, p, scores) + "\n");
    }
    writer.close();
  }
  
  public int solve (int S, int p, int [] scores) {
    int count = 0;
    for (int score : scores) {
      int mod = score % 3;
      int max;
      if (mod == 0) {
        max = score / 3;
        if (max >= p) {
          ++count; continue;
        }
        if (score < 3) {
          continue;
        }
        if (max < p - 1) {
          continue;
        }
        if (S > 0) {
          --S; ++count; continue;
        }
      } else if (mod == 1) {
        max = (score - 1) / 3 + 1;
        if (max >= p) {
          ++count; continue;
        }
        continue;
      } else if (mod == 2) {
        max = (score - 2) / 3 + 1;
        if (max >= p) {
          ++count; continue;
        }
        if (max < p - 1) {
          continue;
        }
        if (S > 0) {
          --S; ++count; continue;
        }
      }
    }
    return count;
  }

}
