package code12.qualification;

import java.io.File;
import java.io.FileWriter;
import java.util.Scanner;

public class B {
	public static String solve(int N, int S, int p, int[] t) {
		
		// 3a 		-> (a, a, a), *(a - 1, a, a + 1)
		// 3a + 1	-> (a, a, a + 1), *(a - 1, a + 1, a + 1)
		// 3a + 2	-> (a, a + 1, a + 1), *(a, a, a + 2)
		
		int numPNoS = 0;
		int numPWithS = 0;
		
		for (int i = 0; i < N; i++) {
			int a = (int)Math.floor(t[i] / 3);
			int r = t[i] % 3;
			
			switch (r) {
			case 0:
				if (a >= p) {
					numPNoS++;
				} else if (a + 1 >= p && a - 1 >= 0) {
					numPWithS++;
				}
				break;
			case 1:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				}
				break;
			case 2:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				} else if (a + 2 >= p) {
					numPWithS++;
				}
				break;
			}
		}
		
		return "" + (numPNoS + Math.min(S, numPWithS));
	}

	public static void main(String[] args) throws Exception {
		// file name
		//String fileName = "Sample";
		//String fileName = "B-small";
		String fileName = "B-large";
		
		// file variable
		File inputFile = new File(fileName + ".in");
		File outputFile = new File(fileName + ".out");
		Scanner scanner = new Scanner(inputFile);
		FileWriter writer = new FileWriter(outputFile);

		// problem variable
		int totalCase;
		int N, S, p;
		int[] t;

		// get total case
		totalCase = scanner.nextInt();

		for (int caseIndex = 1; caseIndex <= totalCase; caseIndex++) {
			// get input
			N = scanner.nextInt();
			S = scanner.nextInt();
			p = scanner.nextInt();
			t = new int[N];
			
			for (int i = 0; i < N; i++) {
				t[i] = scanner.nextInt();
			}
			
			String output = "Case #" + caseIndex + ": " + solve(N, S, p, t);
			System.out.println(output);
			writer.write(output + "\n");
		}
		scanner.close();
		writer.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);
    }
    
  }
  
}