package googlers;

import java.util.Scanner;
import java.util.PriorityQueue;
import java.util.Comparator;
public class Googlers {
	
	public static void main(String[] args) {
		
		int n,s,p,count=0,t;		
		Scanner sin=new Scanner(System.in);
		
		t=Integer.parseInt(sin.nextLine());
		
		
		int result[]=new int[t];
		int j=0;
		
		if(t>=1 && t<=100)
		{
		for (int k = 0; k < t; k++) {
		count=0;	
		
			
        String ip = sin.nextLine();
        
        String[]tokens=ip.split(" ");
		
		
		n=Integer.parseInt(tokens[0]);
		s=Integer.parseInt(tokens[1]);
		p=Integer.parseInt(tokens[2]);
		
		if( (s>=0 && s<=n) && (p>=0 && p<=10) )
		{
		int[] total=new int[n];
		
		
		for (int i = 0; i < n; i++)
        {
            total[i] = Integer.parseInt(tokens[i+3]);
        }
		
		Comparator comparator=new PointComparator();
		PriorityQueue pq=new PriorityQueue<Point>(1, comparator);
		
		for (int i = 0; i < n; i++)
		{
			
			int x=total[i]/3;
			int r=total[i]%3;
			if(x>=p)
				count++;
			else if(x<(p-2))
				continue;
			else
			{
				//System.out.println("enter "+x+" "+(p-2));
				if(p-x==1)
				{
					Point temp=new Point();
					temp.q=x;
					temp.r=r;
					pq.add(temp);
				}
				else  // p-x=2
				{
					if(r==0)
						continue;
					else
					{
						Point temp=new Point();
						temp.q=x;
						temp.r=r;
						pq.add(temp);
					}				
					
				}
					
			}
			//System.out.println("hi "+pq.size());
			
		}
		
		
		
		while(pq.size()!=0)
		{
			Point temp=(Point)pq.remove();
			if(p-temp.q==1 && temp.q!=0)
			{
				if(temp.r>=1)
					count++;
				else
				{
					if(s!=0)
					{
						s--;
						count++;
					}
				}
			}
			else if(p-temp.q==2)
			{
				if(s!=0 && (temp.q+temp.r)>=p)
				{
					s--;
					count++;
				}
			}
			
				
		}
		
		//System.out.println(p);
		
		result[j++]=count;
		
		}
		}
		
		for (int i = 0; i < t; i++) 
		{
			System.out.println("Case #"+(i+1)+": "+result[i]);
		}
		}
		
	}
        
        
		
		/*Point x=new Point();
		x.q=8;
		Point y=new Point();
		y.q=6;
		Point z=new Point();
		z.q=7;
		
		pq.add(x);
		pq.add(y);
		pq.add(z);
		*/
		
		
		
		
	

}

class PointComparator implements Comparator<Point>
{
    @Override
    public int compare(Point x, Point y)
    {
        // Assume neither string is null. Real code should
        // probably be more robust
        if (x.q < y.q)
        {
            return 1;
        }
        if (x.q  > y.q)
        {
            return -1;
        }
        return 0;
    }
}



class Point
{
	int q,r;

	public int getQ() {
		return q;
	}

	public void setQ(int q) {
		this.q = q;
	}

	public int getR() {
		return r;
	}

	public void setR(int r) {
		this.r = r;
	}
	
	
}

package sholay;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Set;

/**
 * GoogleDancers
 */
public class GoogleDancers {

	public static String INPUT_FILE_NAME = "B-small-attempt0.in";
	public static String OUTPUT_FILE_NAME = "B-small-attempt0.out";

	class Player implements Comparable<Player> {

		int totalScore;
		int x;
		int y;
		int z;
		int thresholdScore;
		boolean isSurprise;
		boolean isMax;

		/**
		 * @param totalScore
		 * @param thresholdScore
		 * @param x
		 * @param y
		 * @param z
		 */
		Player(int totalScore, int thresholdScore, int x, int y, int z) {
			this.totalScore = totalScore;
			this.thresholdScore = thresholdScore;
			this.x = x;
			this.y = y;
			this.z = z;
			isSurprise = (Math.abs(x - y) >= 2d || Math.abs(y - z) >= 2d || Math
					.abs(x - z) >= 2d);
			isMax = (x >= thresholdScore) || (y >= thresholdScore)
					|| (z >= thresholdScore);
		}

		@Override
		public int compareTo(Player arg0) {
			return (isMax && !isSurprise) ? 1
					: ((isMax && isSurprise) ? 0 : -1);
		}
	}

	//
	Map<Integer, java.util.List<Player>> map = new HashMap<Integer, java.util.List<Player>>();

	/**
	 * Read the input file, decode the input and write the output file
	 * 
	 * @throws IOException
	 */
	public void solve() throws IOException {
		BufferedReader in = null;
		PrintWriter out = null;
		try {
			in = new BufferedReader(new FileReader(getFile(INPUT_FILE_NAME)));
			out = new PrintWriter(new FileWriter(OUTPUT_FILE_NAME));
			String line = null;
			int lineNum = 0;
			int numTestCase = 0;
			int count = 0;
			while ((line = in.readLine()) != null) {
				if (lineNum >= 0) {
					if (lineNum == 0) {
						numTestCase = Integer.parseInt(line);
					} else {
						count++;
						if (count <= numTestCase) {
							int solution = getMaxBestResult(line);
							out.write("Case #" + count + ": " + solution);
							if (count != numTestCase) {
								out.write("\n");
							}
						} else {
							break;
						}
					}
				}
				lineNum++;
			}

		} catch (Exception ex) {
			System.out.println("Program failed :" + ex.getMessage());
		} finally {
			in.close();
			out.close();
		}
	}

	/**
	 * @param line
	 * @return
	 */
	private int getMaxBestResult(String line) {
		map.clear();
		String[] lineArray = line.split(" ");
		int totalPlayers = Integer.parseInt(lineArray[0]);
		if (totalPlayers > 0) {
			int surprise = Integer.parseInt(lineArray[1]);
			int threshold = Integer.parseInt(lineArray[2]);
			for (int i = 0; i < totalPlayers; i++) {
				List<Player> players = getPossiblePlayers(surprise, threshold,
						Integer.parseInt(lineArray[3 + i]));
				map.put(i, players);
			}
			return findMaxBest(surprise, map);
		}
		return 0;
	}

	/**
	 * @param surprise
	 * @param map
	 * @return
	 */
	private int findMaxBest(int surprise, Map<Integer, List<Player>> map) {
		int maxBest = 0;
		Set<Integer> players = map.keySet();
		for (Integer player : players) {
			List<Player> possibility = map.get(player);
			Player p = getPlayer(surprise, possibility);
			if (p != null) {
				if (p.isMax) {
					maxBest++;
				}
				if (p.isSurprise) {
					surprise--;
				}
			}
		}
		return maxBest;
	}

	/**
	 * @param surprise
	 * @param possibility
	 * @return
	 */
	private Player getPlayer(int surprise, List<Player> possibility) {
		Player pp = null;
		Collections.sort(possibility,Collections.reverseOrder());
		for (Player p : possibility) {
			if (p.isMax && !p.isSurprise) {
				pp = p;
			break;
			}
		}
		if (pp == null) {
			for (Player p : possibility) {
				if (p.isMax && p.isSurprise && surprise > 0) {
					pp = p;
				break;
				}
			}
		}
		if (pp == null) {
			for (Player p : possibility) {
				if (!p.isSurprise && surprise <= 0) {
					pp = p;
				break;
				}
			}
		}
		if (pp == null) {
			for (Player p : possibility) {
				if (!p.isSurprise) {
					pp = p;
				break;
				}
			}
		}
		return pp;
	}

	/**
	 * @param surprise
	 * @param threshold
	 * @param i
	 * @return
	 */
	private List<Player> getPossiblePlayers(int surprise, int threshold,
			int totalScore) {
		List<Player> players = new ArrayList<Player>();
		//
		if ((totalScore) % 3 == 0) {
			int div = (totalScore) / 3;
			if(div>=0) {
				players.add(new Player(totalScore, threshold, div, div, div));
			}
		}
		//
		if ((totalScore - 1) % 3 == 0) {
			int div = (totalScore - 1) / 3;
			if(div>=0){
				players.add(new Player(totalScore, threshold, div, div, div + 1));
			}
		}
		//
		if ((totalScore - 2) % 3 == 0) {
			int div = (totalScore - 2) / 3;
			if(div>=0) {
				players.add(new Player(totalScore, threshold, div, div + 1, div + 1));
				players.add(new Player(totalScore, threshold, div, div, div + 2));
			}
		}
		//
		if ((totalScore - 3) % 3 == 0) {
			int div = (totalScore - 3) / 3;
			if(div>=0) {
				players.add(new Player(totalScore, threshold, div, div + 1, div + 2));
			}
		}
		//
		if ((totalScore - 4) % 3 == 0) {
			int div = (totalScore - 4) / 3;
			if(div>=0) {
				players.add(new Player(totalScore, threshold, div, div + 2, div + 2));
			}
		}
		return players;
	}

	/**
	 * @param fileName
	 * @return
	 */
	public static File getFile(String fileName) {
		return new File(fileName);
	}

	/**
	 * @param args
	 * @throws IOException
	 */
	public static void main(String[] args) throws IOException {
		GoogleDancers googleDancers = new GoogleDancers();
		googleDancers.solve();
	}

}
