/**
 * Created by IntelliJ IDEA.
 * User: Administrator
 * Date: 3/3/12
 * Time: 11:00 AM
 * To change this template use File | Settings | File Templates.
 */

import SRMLib.MathLibrary;
import SRMLib.TestSRMLib;
import com.sun.org.apache.bcel.internal.generic.F2D;

import java.io.*;
import java.util.*;
import java.util.zip.Inflater;

public class SRM {
    public static void main(String[] args) throws IOException {
        //TestSRMLib.run();
        codeJam1.main();

        return;
    }
}
class codeJam1 {
    public static void main() throws IOException {
        String inputPath = "E:\\input.txt";
        String outputPath = "E:\\output.txt";
        BufferedReader input = new BufferedReader(new FileReader(inputPath));
        BufferedWriter output = new BufferedWriter(new FileWriter(outputPath));

        String line;
        line = input.readLine();
        int T = Integer.parseInt(line);
        for (int i = 1; i <= T; ++i) {
            line = input.readLine();
            String[] words = line.split(" ");
            int N = Integer.parseInt(words[0]);
            int S = Integer.parseInt(words[1]);
            int p = Integer.parseInt(words[2]);
            int n = 0;
            int res = 0;

            for (int j = 3; j < words.length; ++j) {
                if (p == 0) {
                    res++;
                    continue;
                }

                int t = Integer.parseInt(words[j]);
                if (p == 1) {
                    if (t > 0)
                        res++;
                    continue;
                }
                if (t >= 3 * p - 2)
                    res++;
                else if (t >= 3 * p - 4)
                    n++;
            }

            res += Math.min(n, S);
            output.write("Case #" + i + ": " + res);
            output.newLine();
        }

        input.close();
        output.close();
    }
}

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

public class dancingWithTheGooglers
{
  
  public static void main (String[] args) throws IOException
  {
    
    File file = new File("in.txt");
    Scanner input = null;
    try
    {
      input = new Scanner(file);
    }
    catch(IOException e){}
    
    int T = input.nextInt();
    int N, S, p, t[];
    int scoreDiv, scoreMod;
    int score[] = new int[3];
    int solution;
    for (int i = 0; i < T; i++)
    {
      N = input.nextInt();
      S = input.nextInt();
      p = input.nextInt();
      t = new int[N];
      solution = 0;
      
      for (int j = 0; j < N; j++)
      {
        t[j] = input.nextInt();
        scoreDiv = t[j] / 3;
        scoreMod = t[j] % 3;
        
        score[0] = scoreDiv;
        score[1] = scoreDiv;
        score[2] = scoreDiv;
        for (int k = 0; k < scoreMod; k++)
        {
          score[k]++;
        }
        if(score[0] >= p || score[1] >= p || score[2] >= p)
          solution++;
        else
        {
          if (S > 0)
          {
            if (scoreMod == 0 || scoreMod == 2)
            {
              if (score[1] > 0)
              {
                score[0]++;
                score[1]--;
              }
              if (score[0] >= p)
              {
                solution++;
                S--;
              }
            }
            else if (scoreMod == 1)
            {
              if (score[2] > 0)
              {
                score[1]++;
                score[2]--;
              }
              if (score[0] >= p)
              {
                solution++;
                S--;
              }
            }
          }
        }
      }
      
      System.out.println("Case #" + (i + 1) + ": " + solution);
    }
    
  }
  
}