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.BufferedReader;
import java.io.FileOutputStream;
import java.io.OutputStreamWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.Writer;

public class Googledance {
	public static void main (String[] args) {
		FileReader fr = null;
		BufferedReader br = null;
		Writer out = null;
		Writer debug = null;
		try {
			fr = new FileReader(args[0]);
			br = new BufferedReader(fr);
			out = new OutputStreamWriter(new FileOutputStream("googledance-result.txt"));
			debug = new OutputStreamWriter(new FileOutputStream("googledance-debug.txt"));
			String numOfLine = br.readLine();
			int line = 0;
			if (numOfLine != null) {
				line = Integer.valueOf(numOfLine);
			} else {
				return;
			}

			String lineData;
			String[] danceArray;

			for (int i = 1; i <= line; i++) {
				String resultLine = "";
				lineData = br.readLine();
				danceArray = lineData.split(" ");
				int numOfGoogler = Integer.valueOf(danceArray[0]);
				int numOfSurprise = Integer.valueOf(danceArray[1]);
				int minSingleScore = Integer.valueOf(danceArray[2]);

				int googlerTotalScore = 0;
				int okCounter = 0;
				int surpriseCounter = 0;
				int kOk = 0, lOk = 0, mOk = 0;
				boolean okNumber = false;
				boolean surpriseNumber = false;
				for (int j = 3; j < 3 + numOfGoogler; j++) {
					okNumber = false;
					surpriseNumber = false;
					kOk = 0; lOk = 0; mOk = 0;
					googlerTotalScore = Integer.valueOf(danceArray[j]);
					if (minSingleScore >=2) {
						for (int k = minSingleScore - 2; k <= 30; k++) {
							if (okNumber && !surpriseNumber) {
								break;
							}
							for (int l = minSingleScore - 2; l <= 30; l++) {
								if (okNumber && !surpriseNumber) {
									break;
								}
								for (int m = minSingleScore - 2; m <= 30; m++) {
									if ((k + l + m) == googlerTotalScore) {
										if (k >= minSingleScore || l >= minSingleScore || m >= minSingleScore) {
											if ((Math.abs(k - l) < 2) && (Math.abs(l - m) < 2) && (Math.abs(k - m) < 2)) {
												okNumber = true;
												kOk = k;
												lOk = l;
												mOk = m;
												surpriseNumber = false;
												break;
											} else if ((Math.abs(k - l) <= 2) && (Math.abs(l - m) <= 2) && (Math.abs(k - m) <= 2)) {
												okNumber = true;
												kOk = k;
												lOk = l;
												mOk = m;
												surpriseNumber = true;
											}
										}
									}
								}
							}
						}

						debug.write("break out at: " + kOk + " " + lOk + " " + mOk + " ok: " + okNumber + " surprise: " + surpriseNumber + "\n");

						if (okNumber) {
							okCounter++;
						}

						if (surpriseNumber) {
							surpriseCounter++;
						}
					} else if (minSingleScore == 1) {
						for (int k = minSingleScore - 1; k <= 30; k++) {
							if (okNumber && !surpriseNumber) {
								break;
							}
							for (int l= minSingleScore - 1; l <= 30; l++) {
								if (okNumber && !surpriseNumber) {
									break;
								}
								for (int m = minSingleScore - 1; m <= 30; m++) {
									if ((k + l + m) == googlerTotalScore) {
										if (k >= minSingleScore || l >= minSingleScore || m >= minSingleScore) {
											if ((Math.abs(k - l) < 2) && (Math.abs(l - m) < 2) && (Math.abs(k - m) < 2)) {
												okNumber = true;
												kOk = k;
												lOk = l;
												mOk = m;
												surpriseNumber = false;
												break;
											} else if ((Math.abs(k - l) <= 2) && (Math.abs(l - m) <= 2) && (Math.abs(k - m) <= 2)) {
												okNumber = true;
												kOk = k;
												lOk = l;
												mOk = m;
												surpriseNumber = true;
											}
										}
									}
								}
							}
						}

						debug.write("break out at: " + kOk + " " + lOk + " " + mOk + " ok: " + okNumber + " surprise: " + surpriseNumber + "\n");

						if (okNumber) {
							okCounter++;
						}

						if (surpriseNumber) {
							surpriseCounter++;
						}
					} else if (minSingleScore == 0) {
						for (int k = minSingleScore; k <= 30; k++) {
							if (okNumber && !surpriseNumber) {
								break;
							}
							for (int l= minSingleScore; l <= 30; l++) {
								if (okNumber && !surpriseNumber) {
									break;
								}
								for (int m = minSingleScore; m <= 30; m++) {
									if ((k + l + m) == googlerTotalScore) {
										if (k >= minSingleScore || l >= minSingleScore || m >= minSingleScore) {
											if ((Math.abs(k - l) < 2) && (Math.abs(l - m) < 2) && (Math.abs(k - m) < 2)) {
												okNumber = true;
												kOk = k;
												lOk = l;
												mOk = m;
												surpriseNumber = false;
												break;
											} else if ((Math.abs(k - l) <= 2) && (Math.abs(l - m) <= 2) && (Math.abs(k - m) <= 2)) {
												okNumber = true;
												kOk = k;
												lOk = l;
												mOk = m;
												surpriseNumber = true;
											}
										}
									}
								}
							}
						}

						debug.write("break out at: " + kOk + " " + lOk + " " + mOk + " ok: " + okNumber + " surprise: " + surpriseNumber + "\n");
						debug.write("\n");

						if (okNumber) {
							okCounter++;
						}

						if (surpriseNumber) {
							surpriseCounter++;
						}
					}
				}

				if (surpriseCounter > numOfSurprise) {
					okCounter = okCounter - (surpriseCounter - numOfSurprise);
				}

				resultLine = "Case #" + i + ": " + okCounter;

				debug.write("\n");
				out.write(resultLine);
				if (i != line) {
					out.write("\n");
				}
				System.out.println(resultLine);
			}
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		} finally {
			try {
				br.close();
				fr.close();
				out.close();
				debug.close();
			} catch(Exception e) {}
		}
	}
}
