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.googlecode.contest.dancing;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;

public class DancingGooglers {

    public static void main(String[] args) throws Exception {
        File outputFile = new File("dancing_googlers_output.txt");
        FileOutputStream fos = new FileOutputStream(outputFile);
        BufferedWriter bufferedWriter = new BufferedWriter(new OutputStreamWriter(fos));
        FileInputStream fis = new FileInputStream(args[0]);
        final String preface = "Case #";
        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(fis));
        String numberOfTestCasesString = bufferedReader.readLine();
        int numberOfTestCases = Integer.parseInt(numberOfTestCasesString);
        for (int i = 1; i <= numberOfTestCases; i++) {
            DancingTestCase testCase = parseString(i, bufferedReader.readLine());
            solveTestCase(testCase);
            System.out.println(preface + i + ": " + testCase.getAnswer());
            bufferedWriter.write(preface + i + ": " + testCase.getAnswer() );
            bufferedWriter.newLine();
            bufferedWriter.flush();
        }

    }

    public static void solveTestCase(DancingTestCase testCase) {
        int possibleGooglers = 0;
        int target = testCase.scoreToBeat;
        int usedSurprises = 0;

        //short circuit for the easiest case
        if (target == 0) {
            testCase.setAnswer(testCase.numberOfDancers);
            return;
        }

        for (String score : testCase.totalScores) {
            int tripletScore = Integer.parseInt(score);
            int quotient = tripletScore/3;
            int modulus = tripletScore%3;
            if (quotient >= testCase.scoreToBeat) {
                System.out.println("1 processing score: " + score);
                possibleGooglers++;
            } else if (tripletScore ==  0 && testCase.scoreToBeat> 0) {
                //continue;
                System.out.println("2 processing score: " + score);
            } else if (quotient + 2 < testCase.scoreToBeat) {
                //continue;
                System.out.println("3 processing score: " + score);
            } else if (quotient + 2 == testCase.scoreToBeat && modulus == 2 && usedSurprises < testCase.surprises) {
                possibleGooglers++;
                usedSurprises++;
                System.out.println("3A processing score: " + score);
            } else if (quotient + 2 == testCase.scoreToBeat ) {
                //continue
                System.out.println("4 processing score: " + score);
            } else if (modulus > 0) {
                possibleGooglers++;
                System.out.println("5 processing score: " + score);
            } else if (modulus == 0 && usedSurprises < testCase.surprises) {
                possibleGooglers++;
                usedSurprises++;
                System.out.println("6 processing score: " + score);
            } else if (modulus == 0 && usedSurprises >= testCase.surprises) {
               //continue
                System.out.println("7 processing score: " + score);
            } else {
                throw new IllegalArgumentException("couldn't handle score: " + score);
            }
        }

        testCase.setAnswer(possibleGooglers);
    }

    public static DancingTestCase parseString(final int testCaseNumber, final String s) {
        StringTokenizer tokenizer = new StringTokenizer(s);
        String dancerString = tokenizer.nextToken();
        int numberOfDancers = Integer.parseInt(dancerString);
        String surpriseString = tokenizer.nextToken();
        int surprises = Integer.parseInt(surpriseString);
        String scoreString = tokenizer.nextToken();
        int scoreToBeat = Integer.parseInt(scoreString);
        ArrayList<String> scores = new ArrayList<String>(numberOfDancers);
        while (tokenizer.hasMoreTokens()) {
            scores.add(tokenizer.nextToken());
        }
        return new DancingTestCase(testCaseNumber, numberOfDancers, surprises, scoreToBeat, scores );
    }


    static class DancingTestCase implements Comparable {
        final int testCaseNumber;
        final int numberOfDancers;
        final int surprises;
        final int scoreToBeat;
        final List<String> totalScores;
        private int answer;

        public DancingTestCase(int testCaseNumber, int numberOfDancers, int surprises, int scoreToBeat, List<String> totalScores) {
            this.testCaseNumber = testCaseNumber;
            this.numberOfDancers = numberOfDancers;
            this.surprises = surprises;
            this.scoreToBeat = scoreToBeat;

            this.totalScores = totalScores;
        }

        public int compareTo(Object o) {
            return 0;
        }

        public int getAnswer() {
            return answer;
        }

        public void setAnswer(int answer) {
            this.answer = answer;
        }
    }
}
