package com.silverduner.codejam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashMap;

public class Dancing {
	public static void main(String[] args) throws Exception {
		File input = new File("B-small-attempt0.in");
		BufferedReader in = new BufferedReader(new FileReader(input));

		File output = new File("1.out");
		BufferedWriter out = new BufferedWriter(new FileWriter(output));

		// parse input
		int N = Integer.parseInt(in.readLine());
		for(int i=0;i<N;i++) {
			String str = in.readLine();
			out.write("Case #"+(i+1)+": ");
			System.out.println("-------");
			String[] words = str.split(" ");
			int n = Integer.parseInt(words[0]);
			int suprise = Integer.parseInt(words[1]);
			int threshold = Integer.parseInt(words[2]);
			int[] scores = new int[n];
			for(int j=0;j<n;j++) {
				scores[j] = Integer.parseInt(words[3+j]);
			}
			int count = 0;
			for(int score : scores) {
				int a,b,c;
				boolean find = false;
				boolean sfind = false;
				for(a = 10; a>=0 && !find; a--) {
					if(3*a-4>score)
						continue;
					for(b = a; b>=0 && b >=a-2 && !find; b--) {
						for(c = b; c>=0 && c >=b-2 && c >=a-2 && !find; c--) {
							System.out.println(a+","+b+","+c);
							if(a+b+c==score) {
								if(a >= threshold) {
									if(a-c <= 1){
										count++;
										find = true;
										System.out.println("find!");
									}
									else if(a-c == 2){
										sfind = true;
										System.out.println("suprise!");
									}
								}
							}
							
						}
					}
				}
				if(!find && sfind && suprise > 0)
				{
					count++;
					suprise --;
				}
			}
			int maxCount = count;
			out.write(maxCount+"\n");
		}
		out.flush();
		out.close();
		in.close();
	}
}

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

public class DancingWithGooglers {

  BufferedReader br;
  StringTokenizer st = new StringTokenizer("");

  private void solve() throws IOException {
//    final String IO_FILE = null;

    final String IO_FILE = "./B/B-small-attempt0";
    final PrintWriter pw;
    if (IO_FILE == null) {
      br = new BufferedReader(new InputStreamReader(System.in));
      pw = new PrintWriter(System.out);
    } else {
      br = new BufferedReader(new FileReader(IO_FILE + ".in"));
      pw = new PrintWriter(IO_FILE + ".out");
    }
    int testCases = nextInt();
    for (int ti = 1; ti <= testCases; ti++) {
      int n = nextInt();
      int s = nextInt();
      int p = nextInt();
      int[] pointSums = new int[n];
      for (int i = 0; i < n; i++) {
        pointSums[i] = nextInt();
      }
      int ans = find(n, s, p, pointSums);
      pw.println("Case #" + ti + ": " + ans);
    }
    br.close();
    pw.close();
  }

  private int find(int n, int s, int p, int[] pointSums) {
    int[][] d = new int[n + 1][s + 1];
    d[0][0] = 0;
    for (int i = 0; i < n; i++) {
      final int sum = pointSums[i];
      for (int j = 0; j <= s; j++) {
        int maxRegularPoint = calcMaxRegularPoint(sum);
        if (p <= maxRegularPoint) {
          d[i + 1][j] = Math.max(d[i + 1][j], d[i][j] + 1);
        }
        else {
          d[i + 1][j] = Math.max(d[i + 1][j], d[i][j]);
          int maxSurprisingPoint = calcMaxSurprisingPoint(sum);
          if (sum >= 2 && p <= maxSurprisingPoint && j != s) {
            d[i + 1][j + 1] = Math.max(d[i + 1][j + 1], d[i][j] + 1);
          }
        }
      }
    }
    int ans = 0;
    for (int j = 0; j <= s; j++) {
      ans = Math.max(ans, d[n][j]);
    }
    return ans;
  }

  private int calcMaxRegularPoint(int sum) {
    return (sum + 2) / 3;
  }

  int calcMaxSurprisingPoint(int sum) {
    return (sum + 4) / 3;
  }

  String nextString() throws IOException {
    while (!st.hasMoreTokens()) {
      st = new StringTokenizer(br.readLine());
    }
    return st.nextToken();
  }

  int nextInt() throws IOException {
    return Integer.parseInt(nextString());
  }

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