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;
	}
	
	
}

import java.io.*;
import java.util.*;

public class Googlers{

	public static int t;
	public int T;
	public int S;
	public int P;
	public int [] ti;
	public int y = 0;
	public int [] v = new int[3];
	public int check = 0;
	public int checkS = 0;

	public static void main(String[] args){

		String [] parse = new String[100];
		int counter = 0;
		int i;

		File inFile = new File("B-small-attempt0.in");
		File outFile = new File("B-small-attempt0.txt");



		try{

			BufferedReader in = new BufferedReader(new FileReader(inFile));
			PrintWriter out = new PrintWriter(new FileWriter(outFile));

			int t = Integer.parseInt(in.readLine());

			Googlers [] testCase = new Googlers[t];

			for(i=0;i<t;i++){

				testCase[i] = new Googlers();

				String s = in.readLine();
				StringTokenizer st = new StringTokenizer(s, " ");
				while(st.hasMoreTokens()) {
					parse[counter++] = st.nextToken();
				}

				testCase[i].T = Integer.parseInt(parse[0]);
				testCase[i].S = Integer.parseInt(parse[1]);
				testCase[i].P = Integer.parseInt(parse[2]);

				testCase[i].ti = new int [testCase[i].T];

				for(int j=3; j<counter;j++){
					testCase[i].ti[j-3] = Integer.parseInt(parse[j]);
				}
				counter = 0;
			}

			for(i=0;i<t;i++){
				for(int j=0; j<testCase[i].ti.length;j++){

					int total = testCase[i].ti[j];

					int fraction = getFraction(total);

					if(fraction>5){
						testCase[i].v[0] = total / 3;
						testCase[i].v[0] = testCase[i].v[0] + 1;
						testCase[i].v[1] = testCase[i].v[0];
						testCase[i].v[2] = total - testCase[i].v[1] - testCase[i].v[0];
					}else{
						testCase[i].v[0] = total / 3;
						testCase[i].v[1] = testCase[i].v[0];
						testCase[i].v[2] = total - testCase[i].v[1] - testCase[i].v[0];
					}

					if(testCase[i].v[0] >= testCase[i].P || testCase[i].v[1] >= testCase[i].P || testCase[i].v[2] >= testCase[i].P){
						testCase[i].y = testCase[i].y + 1;
					}else{
						if(testCase[i].S != 0){
							if(testCase[i].checkS < testCase[i].S){
								testCase[i].v[0] = testCase[i].P;
								testCase[i].v[1] = testCase[i].P - 2;
								testCase[i].v[2] = total - testCase[i].v[1] - testCase[i].v[0];

								if(testCase[i].v[0] < total){
									if((testCase[i].v[0] >= 0 || testCase[i].v[1] >= 0 || testCase[i].v[2] >= 0) && (testCase[i].v[0] <= 10 || testCase[i].v[1] <= 10 || testCase[i].v[2] <= 0)){
										if(testCase[i].v[0] > testCase[i].v[2]){
											if(testCase[i].v[0] - testCase[i].v[2]<=2){
												testCase[i].y = testCase[i].y + 1;
												testCase[i].checkS = testCase[i].checkS + 1;
											}
										}else{
											if(testCase[i].v[2] - testCase[i].v[0]<=2){
												testCase[i].y = testCase[i].y + 1;
												testCase[i].checkS = testCase[i].checkS + 1;
											}
										}
									}
								}
							}
						}

					}
				}

				out.println("Case #" + (i+1) + ": " + testCase[i].y);
			}

			in.close();
			out.close();
		}catch(IOException e){
			e.printStackTrace();
		}

	}

	public static void calTriplets(int a){

			int total = a;

			int fraction = getFraction(total);

			if(fraction>5){

				int v1 = total / 3;

				v1 = v1 + 1;

				int v2 = v1;

				int v3 = total - v1 - v2;

			}else{

				int v1 = total / 3;

				int v2 = v1;

				int v3 = total - v1 - v2;

			}

	}

	public static int getFraction(int value){

		double a = (double) value / 3;

		String b = Double.toString(a);

		int c = b.indexOf(".");

		Character d = new Character(b.charAt(c+1));

		String e = d.toString();

		int f = Integer.parseInt(e);

		//System.out.println(f);

		return f;
	}

}