import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}

import java.util.ArrayList;
import java.util.Arrays;
public class Problem2
{
    public int countResults(String[] nums){
        int googlers = Integer.parseInt(nums[0]);
        int surprising = Integer.parseInt(nums[1]);
        int min = Integer.parseInt(nums[2]);
        int count = 0;
        int[] possible = new int[googlers];
        System.out.println("Min: "+min+", Surprising: "+surprising);
        for(int i = 3; i<nums.length;i++){
            int curr = Integer.parseInt(nums[i]);
            System.out.println("Curr: "+curr);
            if(curr<=1){
                if(min==0){
                    count+=1;
                }
                else if(curr==1&&min==1){
                    count+=1;
                }
                continue;
            }
            switch(curr%3){
                case 0:
                    if(curr/3+1==min){
                        possible[i-3]=1;
                    }
                    else if(curr/3>=min){
                        count+=1;
                    }
                    break;
                case 1:
                    if(curr/3+1>=min){
                        count+=1;
                    }
                    break;
                case 2:
                    if(curr/3+1>=min){
                        count+=1;
                    }
                    else if(curr/3+2>=min){
                        possible[i-3]=1;
                    }
            }
            System.out.println("Count: "+count+", possible: "+possible[i-3]);
        }
        Arrays.sort(possible);
        for(int j=0;j<surprising;j++){
            System.out.println("Switching "+possible[possible.length-1-j]);
            count+=possible[possible.length-1-j];
        }
        System.out.println("Final Count "+count);
        return count;
    }
    public void solve(){
        ReadWriter rw = new ReadWriter();
        ArrayList<String> input = rw.readFile("B-small-attempt0.in");
        ArrayList<String> ans = new ArrayList<String>();
        int num;
        boolean first = true;
        int count=0;
        for(String s : input){
            if(first){
                num=Integer.parseInt(s);
                first=false;
            }
            else{
                String[] nums = s.split(" ");
                ans.add("Case #"+count+": "+countResults(nums));
            }
            count++;
        }
        rw.writeFile(ans, "output2.txt");
    }
}
