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.util.*;

public class Main {

  public static void main(String args[]) {
    (new Main()).solve();
  }

  void solve() {

    Scanner cin = new Scanner(System.in);
    int T = cin.nextInt();

    for(int C=1; C<=T; ++C) {

      int N = cin.nextInt();
      int S = cin.nextInt();
      int P = cin.nextInt();

      int arr[] = new int[N];
      for(int i=0; i<N; ++i) { arr[i] = cin.nextInt(); }

      int dp[][] = new int[N+1][S+1];

      for(int i=0; i<=N; ++i) {
        for(int j=0; j<=S; ++j) {
          dp[i][j] = -1;
        }
      }

      dp[0][0] = 0;

      for(int i=0; i<N; ++i) {
        int V = arr[i];
        for(int j=0; j<=S; ++j) {
          if( dp[i][j] == -1 ) { continue; }
          for( int d = 0; d <= (j < S ? 2 : 1); ++d ) {
            for(int k=0; k<=10; ++k) {
              if( k + d > 10 ) { continue; }
              int rest = V - k - k - d;
              if( k <= rest && rest <= (k + d) ) {
                int gain = (k + d >= P) ? 1 : 0;
                int s = d == 2 ? 1 : 0;
                dp[i + 1][j + s] = Math.max(dp[i + 1][j + s], dp[i][j] + gain);
              }
            }
          }
        }
      }

      System.out.println("Case #" + C + ": " + dp[N][S]);

    }

  }

}
