import java.util.*;
public class Test {
  public static void main(String[] args){
    Scanner in = new Scanner(System.in);
    int T = in.nextInt();

    for(int i = 1; i<=T; i++) {
      int n = in.nextInt();
      int s = in.nextInt();
      int p = in.nextInt();
      int result = 0;
      for(int j = 0; j<n; j++){
        int x = canAddUp(in.nextInt(), p);
        if(x == 0) {
          result++;
        } else if (x==1 && s > 0) {
          result++;
          s--;
        }
      }
      System.out.println("Case #"+i+": "+result);
    }
  }

  public static int canAddUp(int sum, int limit) {
    boolean flag = false;
    for(int i = 0; i<=sum; i++) {
      for(int j = 0; i+j <= sum; j++) {
        int k = sum-(i+j);
        int a = Math.abs(i-j);
        int b = Math.abs(i-k);
        int c = Math.abs(j-k);
        if(a > 2 || b > 2 || c> 2){
          continue;
        }

        if (i>=limit || j>=limit || k>=limit) {
          if(a < 2 && b < 2 && c < 2) {
            return 0;
          }else{
            flag = true;
          }
        }
      }
    }
    return (flag) ? 1 : 2;
  }
}

import java.io.IOException;


public class DancingGooglers extends FileReaderWriter {

	/*//int[] GOOG = {29, 20, 8, 18, 18, 21};
	int[] GOOG = {23, 22, 21};*/
	
	DancingGooglers(String inPath, String outPath) throws IOException {
		super(inPath, outPath);
		reader();
		
	}
	
	@Override
	public void reader() throws IOException {
		super.writer();
		strLine = br.readLine();
		nTestCases = Integer.valueOf(strLine);
		
		int N, S, p;
		int nthCase = 0;
		
		int googlerCount = 0;
		
		String toWrite = new String();
		
		
		//While LOOP
		while( (strLine = br.readLine()) != null ) {
			googlerCount = 0;
			++nthCase;
			toWrite = toWrite + "Case #" + nthCase + ": ";
			String[] handler = strLine.split(" ");
			
			int[] GOOG = new int[handler.length];
			
			for(int i=0; i<handler.length; ++i) {
				GOOG[i] = Integer.valueOf(handler[i]);
			}
			
			N = GOOG[0];
			S = GOOG[1];
			p = GOOG[2];
			
			for(int i=3; i<GOOG.length; ++i) {
				int base = (int) GOOG[i] / 3;
				
				switch (GOOG[i] % 3) 
				{
					case 0:
					{
						if(base >= p)
							++googlerCount;
						else {
							if(S>0 && base>0 && base+1>=p) {
								++googlerCount;
								--S;
							}
						}
						break;
					}
					
					case 1:
					{
						if(base >= p || base+1 >= p) {
							++googlerCount;
						}
						else {
							if(S > 0 && base + 1 >= p) {
								++googlerCount;
								S--;
							}
						}
						break;
					}
					
					case 2:
					{
						if(base + 1 >= p || base >= p) {
							++googlerCount;
						}
						else {
							if(S > 0 && base + 2 >= p) {
								++googlerCount;
								--S;
							}
						}
						break;
					}
				}				
			}
			toWrite = toWrite + googlerCount + "\n";			
		}
		System.out.println(toWrite);
		bw.write(toWrite);
		bw.close();
	}

}
