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 com.edwarddrapkin;

import java.io.File;
import java.io.IOException;
import java.util.Scanner;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;
import java.util.concurrent.atomic.AtomicInteger;

public class Dancing {
	AtomicInteger possibleNoCheat = new AtomicInteger(0);
	AtomicInteger possibleWithCheatOnly = new AtomicInteger(0);
	AtomicInteger jobsWorking = new AtomicInteger(0);
	
	ExecutorService service = Executors.newFixedThreadPool(4);
	
	private void reset() {
		possibleNoCheat = new AtomicInteger(0);
		possibleWithCheatOnly = new AtomicInteger(0);
	}
	
	private boolean testArray(int[] arr, int input, int maxDist, int minimumPositive) {
		if(arr[0] + arr[1] + arr[2] != input) {
			return false;
		}
		
		int diff1 = Math.abs(arr[0] - arr[1]);
		int diff2 = Math.abs(arr[0] - arr[2]);
		int diff3 = Math.abs(arr[1] - arr[2]);
		
		if( (diff1 > maxDist || diff2 > maxDist || diff3 > maxDist) || (arr[0] < minimumPositive && arr[1] < minimumPositive && arr[2] < minimumPositive)) {
			return false;
		} else {
			return true;
		}
		
	}
	
	
	private void calculatePossibleScores(final int total, final int maxcheat, final int minimumPositive) {
		Runnable r = new Runnable() {
			public void run() {
				int[] working = new int[3];
				
				boolean withCheat = false;
				
				for(int i = 0; i <= 10; i++) {
					working[0] = i;
					
					for(int j = 0; j <= 10; j++) {
						working[1] = j;
						
						for(int k = 0; k <= 10; k++) {
							working[2] = k;
							
							if(working[0] + working[1] + working[2] != total) {
								continue;
							}
							
							if(testArray(working, total, 1, minimumPositive)) {
								//System.out.println(Arrays.toString(working) + " " + maxcheat + " " + total + " " + minimumPositive);
								possibleNoCheat.incrementAndGet();
								jobsWorking.decrementAndGet();
								return;
							} else if (!withCheat) {
								if(testArray(working, total, 2, minimumPositive)) {
									withCheat = true;
								}
							}
						}
					}
				}
			
				if(withCheat) {
					possibleWithCheatOnly.incrementAndGet();
				}
				
				jobsWorking.decrementAndGet();
			}
		};
		
		service.execute(r);
	}
	
	public void doEverything(String file) throws Exception {
		String[] lines = readFile(file);
		
		int casen = 1;
		
		for(String line : lines) {
			reset();
			//System.out.println("\n\n\n");
			String[] sints = line.split("\\s+");
			int[] ints = new int[sints.length];
			
			for(int i = 0; i < sints.length; i++) {
				ints[i] = Integer.parseInt(sints[i]);
			}
			
			int numGooglers = ints[0];
			int start = 3; 
			int maxcheat = ints[1];
			int minPositive = ints[2];
			
//			System.out.println(numGooglers + " " + maxcheat + " " + minPositive);
			
			for(int i = start; i < ints.length; i++) {
//				System.out.println("Testing: " + ints[i]);
				jobsWorking.incrementAndGet();
				
				calculatePossibleScores(ints[i], maxcheat, minPositive);
//				System.out.println();
			}
			
			while(jobsWorking.get() > 0) {
				Thread.sleep(100);
			}
			
			System.out.println("Case #" + casen + ": " + (possibleNoCheat.get() + (possibleWithCheatOnly.get() > maxcheat ? maxcheat : possibleWithCheatOnly.get())));
			casen++;
		}
		
		service.shutdown();
	}
	
	public static void main(String[] args) throws Throwable {
		new Dancing().doEverything("C:/Users/Eddie/Desktop/google_input.txt");
		
	}
	
	private static String[] readFile(String file) throws IOException {
		Scanner scanner = new Scanner(new File(file));
		
		String numLines = scanner.nextLine();
		
		int nl = Integer.parseInt(numLines);
		
		String[] lines = new String[nl];
		int i = 0;
		
		while(scanner.hasNextLine() && i < nl) {
			lines[i] = scanner.nextLine();
			++i;
		}
		
		return lines;
	}
}
