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;
  }
}

//package com.GoogleCodeJam.y2012.Qualification.DancingWithTheGooglers;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;

public class DancingWithTheGooglers {
	public static void main(String[] args) {
		try {
			BufferedReader in = new BufferedReader(new FileReader(new File("B-large.in")));
			int numCases = Integer.parseInt(in.readLine());
			for (int caseNum = 1; caseNum <= numCases; caseNum++) {
				String[] caseInput = in.readLine().split(" ");
				int numFound = getNumOverBar(caseInput);
				System.out.println("Case #"+ caseNum + ": " + numFound);
			}
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		}
	}
	public static int getNumOverBar(String[] caseInput) {
		int numGooglers = Integer.parseInt(caseInput[0]);
		int surprisingRemaining = Integer.parseInt(caseInput[1]);
		int minThreshhold = Integer.parseInt(caseInput[2]);
		int numFound = 0;
		for (int scoreId = 3; scoreId < (numGooglers + 3); scoreId ++) {
			int givenScore = Integer.parseInt(caseInput[scoreId]);
			int checkedScore = givenScore %3 == 0 ? givenScore : (givenScore + 3 - givenScore %3);
			if (checkedScore/3 >= minThreshhold) {
				numFound ++;
			} else if (givenScore == 0) {
				if (minThreshhold == 0) {
					numFound++;
				}
			} else if (surprisingRemaining > 0) {
				if (givenScore % 3 == 2) {
					if ((givenScore + 4)/3 >= minThreshhold) {
						numFound ++;
						surprisingRemaining --;
					}
				} else if (givenScore % 3 == 0) {
					if ((givenScore+3) / 3 >= minThreshhold) {
						numFound ++;
						surprisingRemaining --;
					}
				}
			}
		}
		return numFound;

	}
}
