import java.util.List;


public class Case implements Runnable {

	private int id;
	private String output;

	private int n;
	private int s;
	private int p;
	private List<Integer> g;

	public Case(int id) {
		this.id = id;
	}

	public Case(int id, int n, int s, int p, List<Integer> g) {
		super();
		this.id = id;
		this.n = n;
		this.s = s;
		this.p = p;
		this.g = g;
	}

	public String solve() {
		int res = 0;
		for (int googler : g) {
			int b = googler / 3;
			boolean div = googler % 3 == 0;
			if (b >= p) {
				res++;
				continue;
			}
			if (p == b+1) {
				if (div && s > 0 && b > 0) {
					res++;
					s--;
					continue;
				}
				if (!div) {
					res++;
					continue;
				}
			}
			if (p == b+2) {
				if (3*b+2 == googler && s > 0) {
					res++;
					s--;
				}
			}
		}
		return String.valueOf(res);
	}

	@Override
	public void run() {
		output = solve();
	}

	@Override
	public String toString() {
		return "Case #" + id + ": " + output;
	}

}
//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-small-attempt0.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;

	}
}
