package com.silverduner.codejam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashMap;

public class Dancing {
	public static void main(String[] args) throws Exception {
		File input = new File("B-small-attempt0.in");
		BufferedReader in = new BufferedReader(new FileReader(input));

		File output = new File("1.out");
		BufferedWriter out = new BufferedWriter(new FileWriter(output));

		// parse input
		int N = Integer.parseInt(in.readLine());
		for(int i=0;i<N;i++) {
			String str = in.readLine();
			out.write("Case #"+(i+1)+": ");
			System.out.println("-------");
			String[] words = str.split(" ");
			int n = Integer.parseInt(words[0]);
			int suprise = Integer.parseInt(words[1]);
			int threshold = Integer.parseInt(words[2]);
			int[] scores = new int[n];
			for(int j=0;j<n;j++) {
				scores[j] = Integer.parseInt(words[3+j]);
			}
			int count = 0;
			for(int score : scores) {
				int a,b,c;
				boolean find = false;
				boolean sfind = false;
				for(a = 10; a>=0 && !find; a--) {
					if(3*a-4>score)
						continue;
					for(b = a; b>=0 && b >=a-2 && !find; b--) {
						for(c = b; c>=0 && c >=b-2 && c >=a-2 && !find; c--) {
							System.out.println(a+","+b+","+c);
							if(a+b+c==score) {
								if(a >= threshold) {
									if(a-c <= 1){
										count++;
										find = true;
										System.out.println("find!");
									}
									else if(a-c == 2){
										sfind = true;
										System.out.println("suprise!");
									}
								}
							}
							
						}
					}
				}
				if(!find && sfind && suprise > 0)
				{
					count++;
					suprise --;
				}
			}
			int maxCount = count;
			out.write(maxCount+"\n");
		}
		out.flush();
		out.close();
		in.close();
	}
}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;


public class Dancing
{
	public int specials = 0;
	
	public int p = 0;
	
	public static void main(String[] args) throws NumberFormatException, IOException 
	{
		 BufferedReader stdin = new BufferedReader
	     (new InputStreamReader(System.in));
		 int n = Integer.parseInt(stdin.readLine());
	     int j = 0;
	     
	     while(j<n)
	     {
	    	 String read = stdin.readLine();
	    	 String arr[] =  read.split("\\s");
	    	 int qty = Integer.parseInt(arr[0]);
	    	 int s = Integer.parseInt(arr[1]);
	    	 int p = Integer.parseInt(arr[2]);
	    	 Dancing dancing = new Dancing();
	    	 dancing.specials = s;
	    	 dancing.p = p;
	    	 int total = 0;
	    	 
	    	 for(int i = 3; i<qty+3; i++ )
	    	 {
	    		total += processGoogler(Integer.parseInt(arr[i]) , dancing);
	    	 }
	    	 StringBuffer sb = new StringBuffer();
	    	 sb.append("Case #"+(j+1)+": ");
	    	 sb.append(Integer.toString(total));
	    	 j++;
	    	 System.out.println(sb.toString());
	     }
		
	}



	private static int processGoogler(int t, Dancing dancing ) 
	{
		if( t == 0 && dancing.p == 0)
			return 1;
		int k = 0;
		if( t != 0)
		{
			if((t-1) % 3 == 0)
			{
				k = (t-1)/3;
				if(k+1>=dancing.p)
					return 1;
				return 0;
			}
			if(t % 3 == 0)
			{
				k = t/3;
				if(k>= dancing.p)
					return 1;
				if(dancing.specials>0)
				{
					if(k+1>=dancing.p)
					{
						dancing.specials--;
						return 1;
					}
				}
			}
			if( (t-2) % 3 == 0)
			{
				k =(t-2)/3;
				if(k+1>= dancing.p)
				{
					return 1;
				}
				if(dancing.specials>0)
				{
					if(k+2>=dancing.p)
					{
						dancing.specials--;
						return 1;
					}
				}
			}
		}
		return 0;
	}
}
