package com.example;

import java.io.IOException;
import java.util.List;

public class ProblemB {
    
    enum Result {
	INSUFFICIENT,
	SUFFICIENT,
	SUFFICIENT_WHEN_SURPRISING
    }

    public static void main(String[] a) throws IOException {

	List<String> lines = FileUtil.getLines("/B-large.in");
	
	int cases = Integer.valueOf(lines.get(0));
	
	for(int c=0; c<cases; c++) {
	    String[] tokens = lines.get(c+1).split(" ");
	    
	    int n = Integer.valueOf(tokens[0]); // N = number of Googlers
	    int s = Integer.valueOf(tokens[1]); // S = number of surprising triplets
	    int p = Integer.valueOf(tokens[2]); // P = __at least__ a score of P
	    
	    int sumSufficient = 0;
	    int sumSufficientSurprising = 0;
	    
	    for(int i=0; i<n; i++) {
		int points = Integer.valueOf(tokens[3+i]);
		
		switch(test(points, p)) {
		case SUFFICIENT:
		    sumSufficient++;
		    break;
		    
		case SUFFICIENT_WHEN_SURPRISING:
		    sumSufficientSurprising++;
		    break;
		}
		
//		uSystem.out.println("points "+ points +" ? "+ p +" => "+ result);
	    }
	    
	    System.out.println("Case #"+ (c+1) +": "+ (sumSufficient + Math.min(s, sumSufficientSurprising)));
	    
//	    System.out.println();
//	    System.out.println("N="+ n +", S="+ s +", P="+ p);
//	    System.out.println();
	}
    }

    private static Result test(int n, int p) {
	int fac = n / 3;
	int rem = n % 3;
	
	if(rem == 0) {
	    
//	    int triplet0[] = { fac, fac, fac };
//	    print(n, triplet0);
	    
	    if(fac >= p) {
		return Result.SUFFICIENT;
	    }
	    
	    if(fac > 0 && fac < 10) {
		
		if(fac+1 >= p) {
		    return Result.SUFFICIENT_WHEN_SURPRISING;
		}
		
//		int triplet1[] = { fac+1, fac, fac-1 }; // surprising 
//		print(n, triplet1);
	    }
	    
	    
	} else if(rem == 1) {
	    
//	    int triplet0[] = { fac+1, fac, fac };
//	    print(n, triplet0);
	    
	    if(fac+1 >= p) {
		return Result.SUFFICIENT;
	    }
	    
//	    if(fac > 0 && fac < 10) {
//		int triplet1[] = { fac+1, fac+1, fac-1 };
//		print(n, triplet1);
//	    }
	    
	} else if(rem == 2) {
	    
//	    int triplet0[] = { fac+1, fac+1, fac };
//	    print(n, triplet0);
	    
	    if(fac+1 >= p) {
		return Result.SUFFICIENT;
	    }
	    
	    if(fac < 9) {
//		int triplet1[] = { fac+2, fac, fac }; // surprising
//		print(n, triplet1);

		if(fac+2 >= p) {
		    return Result.SUFFICIENT_WHEN_SURPRISING;
		}
	    }
	    
	} else {
	    throw new RuntimeException("error");
	}
	
	return Result.INSUFFICIENT;
//	System.out.println();
//	System.out.println(n +" => "+ div3 +" ("+ rem +")");
    }
    
//    private static void print(int n, int[] triplet) {
//	System.out.println("n="+ n +" ("+ (n/3) +","+ (n%3) +") => ["+ triplet[0] +","+ triplet[1] +","+ triplet[2] +"]" + (triplet[0]-triplet[2] > 1 ? " *" : ""));
//    }
    
}


public class Dancing_With_the_Googlers {

	public int solve1(int s, int p, int[] t)
	{
		int ans=0;
		for (int i=0;i<t.length;i++)
		{
			boolean next=false;
			for(int a0=0;a0<=t[i];a0++)
			{
				for(int a1=0;a0+a1<=t[i];a1++)
				{
					int a2=t[i]-a1-a0;
					if(a2<0)
						continue;
					
					if(Math.abs(a0-a1)<=2 && Math.abs(a1-a2)<=2 && Math.abs(a0-a2)<=2)
					if(Math.abs(a0-a1)<2 && Math.abs(a1-a2)<2 && Math.abs(a0-a2)<2)
					{
						if(a0>=p || a1>=p || a2>=p)
						{
							ans++;
							next=true;
							break;
						}
					}

				}
				if(next)
					break;
			}
			if(next)
				continue;
			for(int a0=0;a0<=t[i];a0++)
			{
				for(int a1=0;a0+a1<=t[i];a1++)
				{
					int a2=t[i]-a1-a0;
					if(a2<0)
						continue;
					if(Math.abs(a0-a1)<=2 && Math.abs(a1-a2)<=2 && Math.abs(a0-a2)<=2)
					if((Math.abs(a0-a1)==2 || Math.abs(a1-a2)==2 || Math.abs(a0-a2)==2) && s>0)
					{
						if(a0>=p || a1>=p || a2>=p)
						{
							s--;
							ans++;
							next=true;
							break;
						}
					}
				}
				if(next)
					break;
			}			
		}
		
		return ans;
	}
	
	public int solve(int s, int p, int[] t)
	{
		int whichContainsMoreThanP=0;
		int ans=0;
		for (int i=0;i<t.length;i++)
		{
			if(t[i]==0)
			{
				if(0>=p)
					ans++;
				continue;
			}else if(t[i]==1)
			{
				if(1>=p)
					ans++;
				continue;
			}
			
			int reminder=t[i]%3;
			int division=t[i]/3;

			switch(reminder)
			{
				case 0:// 1,2 or 0,0
					if(division>=p)
					{
						whichContainsMoreThanP++;
						continue;
					}
					break;
				case 1:// 2,2 or 0,1
					if(division+1>=p)
					{
						whichContainsMoreThanP++;
						continue;
					}
					break;
				case 2:// 0,2 or 1,1
					if(division+1>=p)
					{
						whichContainsMoreThanP++;
						continue;
					}
					break;
				default:
			}
			
			switch(reminder)
			{
				case 0:// 1,2 or 0,0
						if(division-1+2>=p && s>0)
						{
							s--;
							ans++;
						}
					break;
				case 1:// 2,2 or 0,1
						if(division-1+2>=p && s>0)
						{
							s--;
							ans++;
						}
					break;
				case 2:// 0,2 or 1,1
						if(division+2>=p && s>0)
						{
							s--;
							ans++;
						}
					break;
				default:
			}

		}
		return ans+whichContainsMoreThanP;
	}
}
/*
 import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.InputStreamReader;


public class Program {


	public static void main(String[] args) {
		
		try {
			FileWriter fileWriter=new FileWriter("B-small-attempt0.out");
			FileReader fileReader=new FileReader("B-small-attempt0.in");
			BufferedReader in = new BufferedReader(fileReader);

			int T= Integer.parseInt(in.readLine());
			for(int t=1;t<=T;t++)
			{
				String[] tokens= in.readLine().split(" ");
				int N= Integer.parseInt(tokens[0]);
				int[] values=new int[N];
				int S= Integer.parseInt(tokens[1]);
				int p= Integer.parseInt(tokens[2]);
				
				for(int n=0;n<N;n++)
				{
					values[n]= Integer.parseInt(tokens[n+3]);
				}
				
				Dancing_With_the_Googlers d=new Dancing_With_the_Googlers();				
				int result=d.solve(S, p, values);
				fileWriter.write("Case #"+t +": " +result+"\n");
				
			}
			fileWriter.close();
			fileReader.close();	
		} catch (Exception e) {
			System.out.println("Error! Exception: "+e); 
		}
		
		
	}

}

 */