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.google.codejam.googlers;

import java.util.List;

/**
 * Main class used for DancingWithGooglers.
 * @author Sushant
 */
public class DancingWithGooglers {
    /**
     * Main method from where application start execution.
     *
     * @param args String []
     */
    public static void main(final String[] args) {
        if (args.length != 1) {
            System.out.println("Problem with the command used for execution");
            System.out.println("Usage: java com.google.codejam.googlers.DancingWithGooglers <Path to input file>");
            System.exit(1);
        }

        final List<TestCase> testCases = InputReader.prepareTestCases(args[0]);
        if (testCases != null && testCases.size() != 0) {
            long startTime = System.currentTimeMillis();
            System.out.println("Test Cases execution start time " + startTime);
            for (TestCase testcase : testCases) {
                executeTestCase(testcase);
            }
            OutputRecorder.generateTestReport(testCases, args[0] + ".out");
            long endTime = System.currentTimeMillis();
            System.out.print("Test cases execution end time " + endTime);
            System.out.println("Total Execution Time " + (endTime - startTime) + " milliseconds");
        }

    }

    /**
     * Method to execute test cases.
     *
     * @param testcase TestCase
     */
    private static void executeTestCase(final TestCase testcase) {
        int bestResultCount = 0;
        final int noOfGooglers = testcase.getNoOfGooglers();
        int noSurpriseScores = testcase.getNoOfurprisingTriplets();
        final int bestResult = testcase.getBestResult();
        final int[] scores = testcase.getScores();
        for (int i = 0; i < noOfGooglers; i++) {
            int[] triplets = new int[3];
            int score = scores[i];
            if(score == 0) {
               triplets[0] = triplets[1] = triplets[2] = 0; 
            } else  if (score % 3 == 0) {
                int tempScore = score / 3;
                triplets[0] = tempScore;
                if (noSurpriseScores != 0 && (Math.abs(triplets[0] - bestResult) == 1 )) {
                    triplets[1] = tempScore + 1;
                    triplets[2] = tempScore - 1;
                    noSurpriseScores = noSurpriseScores - 1;
                } else {
                    triplets[1] = tempScore;
                    triplets[2] = tempScore;
                }
            } else {
                triplets[0] = score / 3;
                int remainingScore = score - triplets[0];
                triplets[1] = remainingScore / 2;
                triplets[2] = score - (triplets[0] + triplets[1]);
                if(noSurpriseScores != 0) {
                    if((triplets[1] != 10 && triplets[2] != 10)
                            && (Math.abs(triplets[2] - bestResult)== 1)) {
                        triplets[1] = triplets[1] + 1;
                        triplets[2] = triplets[2] - 1;
                        noSurpriseScores = noSurpriseScores - 1;
                    }
                }
            }
            boolean isBest = isBestTriplet(triplets, bestResult);
            if(isBest) {
                bestResultCount = bestResultCount + 1;
            }

        }
        testcase.setOutput(new TestResult(bestResultCount));
    }

    /**
     * Method to check whether given triplet is best or not.
     * @param triplets int []
     * @param bestResult int
     * @return boolean
     */
    private static boolean isBestTriplet(final int[] triplets, final int bestResult) {
        for(int i = 0; i < triplets.length; i++) {
            if(triplets[i] >= bestResult) {
                return true;
            }
        }
        return false;
    }
}
