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 ? " *" : ""));
//    }
    
}

package main;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.LinkedList;
import java.util.List;
import java.util.StringTokenizer;

public class QualificationB {

  public static void main(String[] args) throws IOException {
    String sampleIn = "input/b_sample.in";
    String sampleOut = "output/b_sample.out";
    
    String smallIn = "input/B-small-attempt0.in";
    String smallOut = "output/B-small-attempt0.out";
    
    String largeIn = "input/B-large.in";
    String largeOut = "output/B-large.out";

    
    String inFile = largeIn;
    String outFile = largeOut;
    
    FileWriter fstream = new FileWriter(outFile);
    BufferedWriter out = new BufferedWriter(fstream);
    
    int ncase = 0;
    for(TestCase tc : loadCodeLines(inFile)) {
      int withoutSurprises = 0;
      int withSurprises = 0;
      for (int s : tc.scores) {
        if (canMakeWithoutSurprise(tc.p, s)) {
          withoutSurprises++;
        } else if (canMakeWithSurprise(tc.p, s)) {
          withSurprises++;
        }
      }
      ncase++;
      System.out.println("Case #" + ncase + ": " + (withoutSurprises + Math.min(tc.s, withSurprises)));
      out.write("Case #" + ncase + ": " + (withoutSurprises + Math.min(tc.s, withSurprises)) + "\n");
      
      //System.out.println("n=" + tc.n + " s=" + tc.s + " p=" + tc.p + " scores=" + tc.scores.toArray());
    }
    out.close();
  }
  
  private static boolean canMakeWithoutSurprise(int p, int score) {
    int rem = score - p;
    if (rem < 0) return false;
    int lower = rem / 2;
    return lower >= Math.max(p-1, 0);
  }
  
  public static boolean canMakeWithSurprise(int p, int score) {
    int rem = score - p;
    if (rem < 0) return false;
    int lower = rem / 2;
    return lower >= Math.max(p-2, 0);
  }
 
  public static List<TestCase> loadCodeLines(String filename){
    List<TestCase> cases = new LinkedList<TestCase>();
    try{
      BufferedReader reader = new BufferedReader(new FileReader(filename));
      String tString = reader.readLine();
      int t = Integer.parseInt(tString);
      for(int i=0; i<t; i++){
        StringTokenizer tokenizer = new StringTokenizer(reader.readLine());
        int n = Integer.parseInt(tokenizer.nextToken(" "));
        int s = Integer.parseInt(tokenizer.nextToken(" "));
        int p = Integer.parseInt(tokenizer.nextToken(" "));
        List<Integer> scores = new LinkedList<Integer>();
        while(tokenizer.hasMoreTokens()) {
          int score = Integer.parseInt(tokenizer.nextToken(" \n"));
          scores.add(score);
        }
        cases.add(new TestCase(n,s,p,scores));
      }
    } catch(Exception e){
      e.printStackTrace();
      throw new RuntimeException("can't load " + filename + "!");
    }
    return cases;
  }

  private static class TestCase {
    public int n, s, p;
    public List<Integer> scores;
    public TestCase(int n, int s, int p, List<Integer> scores) {
      this.n = n;
      this.s = s;
      this.p = p;
      this.scores = scores;
    }
  }
  
}
