import java.util.*;
import java.io.*;

public class DancingWithTheGooglers
{
    public DancingWithTheGooglers()
    {
        Scanner inFile = null;
        try
        {
            inFile = new Scanner(new File("inputB.txt"));
        }
        catch(Exception e)
        {
            System.out.println("Problem opening input file. Exiting...");
			System.exit(0);
        }
        int t = inFile.nextInt();
        
        int [] results = new int [t];
        DancingWithTheGooglersMax [] rnc = new DancingWithTheGooglersMax[t];
        
        int i, j;
        int [] scores;
        int s, p;
        for(i = 0; i < t; i++)
        {
            scores = new int [inFile.nextInt()];
            s = inFile.nextInt();
            p = inFile.nextInt();
            for(j = 0; j < scores.length; j++)
                scores[j] = inFile.nextInt();
            
            rnc[i] = new DancingWithTheGooglersMax(i, scores, s, p, results);
            rnc[i].start();
        }
        inFile.close();
        
        boolean done = false;
        
        while(!done)
        {
            done = true;
            for(i = 0; i < t; i++)
                if(rnc[i].isAlive())
                {
                    done = false;
                    break;
                }
        }
        
        PrintWriter outFile = null;
        try
        {
            outFile = new PrintWriter(new File("outputB.txt"));
        }
        catch(Exception e)
        {
            System.out.println("Problem opening output file. Exiting...");
			System.exit(0);
        }
        
        for(i = 0; i < results.length; i++)
            outFile.printf("Case #%d: %d\n", i+1, results[i]);
        outFile.close();
    }
    
    public static void main(String [] args)
    {
        new DancingWithTheGooglers();
    }
    
    private class DancingWithTheGooglersMax extends Thread
    {
        int id;
        int s, p;
        int [] results, scores;
        
        public DancingWithTheGooglersMax(int i, int [] aScores, int aS, int aP,int [] res)
        {
            id = i;
            s = aS;
            p = aP;
            results = res;
            scores = aScores;
        }
        
        public void run()
        {
            int a = 0, b = 0;
            
            if(p == 0)
                results[id] = scores.length;
            else if(p == 1)
            {
                int y;
                y = 3*p - 3;
                
                for(int i = 0; i < scores.length; i++)
                    if(scores[i] > y)
                        a++;
                    else if(scores[i] > 0)
                        b++;
                
                b = Math.min(b, s);
                results[id] = a+b;
            }
            else
            {
                int y, z;
                y = 3*p - 3;
                z = 3*p - 5;
                
                for(int i = 0; i < scores.length; i++)
                    if(scores[i] > y)
                        a++;
                    else if(scores[i] > z)
                        b++;
                
                b = Math.min(b, s);
                results[id] = a+b;
            }
        }
    }
}

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); 
		}
		
		
	}

}

 */