package com.example;

import java.io.IOException;
import java.util.List;

public class ProblemB {
    
    enum Result {
	INSUFFICIENT,
	SUFFICIENT,
	SUFFICIENT_WHEN_SURPRISING
    }

    public static void main(String[] a) throws IOException {

	List<String> lines = FileUtil.getLines("/B-large.in");
	
	int cases = Integer.valueOf(lines.get(0));
	
	for(int c=0; c<cases; c++) {
	    String[] tokens = lines.get(c+1).split(" ");
	    
	    int n = Integer.valueOf(tokens[0]); // N = number of Googlers
	    int s = Integer.valueOf(tokens[1]); // S = number of surprising triplets
	    int p = Integer.valueOf(tokens[2]); // P = __at least__ a score of P
	    
	    int sumSufficient = 0;
	    int sumSufficientSurprising = 0;
	    
	    for(int i=0; i<n; i++) {
		int points = Integer.valueOf(tokens[3+i]);
		
		switch(test(points, p)) {
		case SUFFICIENT:
		    sumSufficient++;
		    break;
		    
		case SUFFICIENT_WHEN_SURPRISING:
		    sumSufficientSurprising++;
		    break;
		}
		
//		uSystem.out.println("points "+ points +" ? "+ p +" => "+ result);
	    }
	    
	    System.out.println("Case #"+ (c+1) +": "+ (sumSufficient + Math.min(s, sumSufficientSurprising)));
	    
//	    System.out.println();
//	    System.out.println("N="+ n +", S="+ s +", P="+ p);
//	    System.out.println();
	}
    }

    private static Result test(int n, int p) {
	int fac = n / 3;
	int rem = n % 3;
	
	if(rem == 0) {
	    
//	    int triplet0[] = { fac, fac, fac };
//	    print(n, triplet0);
	    
	    if(fac >= p) {
		return Result.SUFFICIENT;
	    }
	    
	    if(fac > 0 && fac < 10) {
		
		if(fac+1 >= p) {
		    return Result.SUFFICIENT_WHEN_SURPRISING;
		}
		
//		int triplet1[] = { fac+1, fac, fac-1 }; // surprising 
//		print(n, triplet1);
	    }
	    
	    
	} else if(rem == 1) {
	    
//	    int triplet0[] = { fac+1, fac, fac };
//	    print(n, triplet0);
	    
	    if(fac+1 >= p) {
		return Result.SUFFICIENT;
	    }
	    
//	    if(fac > 0 && fac < 10) {
//		int triplet1[] = { fac+1, fac+1, fac-1 };
//		print(n, triplet1);
//	    }
	    
	} else if(rem == 2) {
	    
//	    int triplet0[] = { fac+1, fac+1, fac };
//	    print(n, triplet0);
	    
	    if(fac+1 >= p) {
		return Result.SUFFICIENT;
	    }
	    
	    if(fac < 9) {
//		int triplet1[] = { fac+2, fac, fac }; // surprising
//		print(n, triplet1);

		if(fac+2 >= p) {
		    return Result.SUFFICIENT_WHEN_SURPRISING;
		}
	    }
	    
	} else {
	    throw new RuntimeException("error");
	}
	
	return Result.INSUFFICIENT;
//	System.out.println();
//	System.out.println(n +" => "+ div3 +" ("+ rem +")");
    }
    
//    private static void print(int n, int[] triplet) {
//	System.out.println("n="+ n +" ("+ (n/3) +","+ (n%3) +") => ["+ triplet[0] +","+ triplet[1] +","+ triplet[2] +"]" + (triplet[0]-triplet[2] > 1 ? " *" : ""));
//    }
    
}

/**
 * Copyright Carma Systems, Inc. All rights reserved.
 */
package com.jessehutton.codejam.qualification2012;

import com.jessehutton.codejam.util.IOHandler;

import java.io.IOException;

/**
 *
 * @author Jesse Hutton <jesse.hutton@carmasys.com>
 */
public class DancingWithGooglers {

  public static void main(String[] args) throws NumberFormatException, IOException {
    String inFile = "/home/jesse/Downloads/B-large.in";
    String outFile = "/home/jesse/Desktop/Dancing-googlers-large.out";

    IOHandler io = new IOHandler(new String[] {inFile, outFile}) {
      @Override
      public String formatCase(int caseNum, Object result) {
        return String.format("Case #%d: %s", caseNum, result);
      }
    };

    int T = Integer.parseInt(io.line().trim());
    for (int c = 1; c <= T; c++) {
      String[] tokens = io.line().split(" ");
      int nGoo = Integer.parseInt(tokens[0]);
      int sups = Integer.parseInt(tokens[1]);
      int p = Integer.parseInt(tokens[2]);
      int results = 0;

      for (int t = 3; t < 3 + nGoo; t++) {
        int tot = Integer.parseInt(tokens[t]);
        int fact = tot / 3;
        int rem = tot % 3;

        if (tot == 0) {
          if (p == 0) {
            results++;
          }
          continue;
        }

        if (fact >= p) {
          results++;
          continue;
        }

        int diff = p - fact;
        if (diff > 2) {
          continue;
        }

        // can arrange without using a sup
        //
        if (diff == 1 && rem >= 1) {
          results++;
          continue;
        }

        // can arrange with using a sup
        //
        if (diff == 1 && rem == 0 && sups > 0) {
          results++;
          sups--;
          continue;
        }

        // diff == 2
        //
        if (sups > 0 && rem == 2) {
          sups--;
          results++;
        }
      }
      io.recordCase(c, results);
    }
    io.finish();
  }

}
