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 code.jam.quali;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Iterator;

class Line {
	int n;
	int s;
	int p;
	ArrayList<Integer> res;

	public Line(int n, int s, int p, ArrayList<Integer> res) {
		super();
		this.n = n;
		this.s = s;
		this.p = p;
		this.res = res;
	}

}

public class Dancing {

	private static final String file = "B-small-attempt0.in";
	private ArrayList<Line> lines;
	private Integer count;

	public static void main(String[] args) throws Exception {
		Dancing g = new Dancing();

		g.readFile();
		g.calculate();

	}

	private void calculate() {

		int i = 1;
		for (Line line : lines) {
			int result = 0;
			int sLim = 0;
			int nsLim = 0;
			if (line.p > 1) {
				nsLim = (3 * line.p) - 2;
				sLim = (3 * line.p) - 4;
			}
			else if (line.p == 1)
			{
				nsLim = 1;
				sLim = 1;
			}

			Integer tp = null;
			Iterator<Integer> it = line.res.iterator();
			while (it.hasNext()) {
				tp = it.next();
				if (tp >= nsLim) {
					result++;
					it.remove();
				}
			}

			it = line.res.iterator();
			while (it.hasNext() && line.s > 0) {
				tp = it.next();
				if (tp >= sLim) {
					result++;
					line.s--;
					it.remove();
				}
			}
			System.out.println("Case #" + i + ": " + result);
			i++;
		}
	}

	private void readFile() {
		BufferedReader br = null;
		try {
			br = new BufferedReader(new FileReader(new File(
					"D:/Martin/Downloads/" + file)));
			String sline = null;
			sline = br.readLine();
			count = Integer.valueOf(sline.trim());
			lines = new ArrayList<Line>();
			while ((sline = br.readLine()) != null) {
				String[] sp = sline.split(" ");
				ArrayList<Integer> r = new ArrayList<>();
				for (int i = 3; i < sp.length; i++)
					r.add(Integer.valueOf(sp[i]));

				Line line = new Line(Integer.valueOf(sp[0]),
						Integer.valueOf(sp[1]), Integer.valueOf(sp[2]), r);
				lines.add(line);

			}
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		} finally {
			if (br != null) {
				try {
					br.close();
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
		}
	}

}
