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 de.ivu.swa.jam;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

/**
 * 0 - 10 Maximal 2 auseinander, also 7..9
 * 
 */
public class App2 {

  private static final String INPUT_FILE  = "c:/jam/input2.txt";

  private static final String OUTPUT_FILE = "c:/jam/output.txt";

  public static void main(String[] args) {
    List<String> lines = readFile();

    List<String> result = new ArrayList<String>();

    for (int i = 1; i < lines.size(); i++) {
      result.add(getResult(lines.get(i)));
    }

    writeFileAsCase(result);

    //    List<Integer> numbers = new ArrayList<Integer>(Arrays.asList(29, 20, 8, 18,
    //        18, 21));
    //    getMaxResults(2, numbers);
  }

  private static String getResult(String line) {
    // TODO Auto-generated method stub
    List<Integer> numbers = new ArrayList<Integer>();
    List<String> split = new ArrayList<String>(Arrays.asList(line.split(" ")));

    int numberOfGooglers = Integer.valueOf(split.get(0));
    int numberOfSurprisingCases = Integer.valueOf(split.get(1));
    int higherThanThis = Integer.valueOf(split.get(2));

    for (int i = 3; i < split.size(); i++) {
      numbers.add(Integer.valueOf(split.get(i)));
    }
    return getMaxResults(numberOfSurprisingCases, higherThanThis, numbers);
  }

  // what is the maximum number of Googlers that could have had a best result of at least p
  // you want to know how many Googlers could have gotten a best result of 8 or better
  private static String getMaxResults(int numberOfSurprisingCases,
      int higherThanThis, List<Integer> numbers) {
    //    Collections.sort(numbers);
    System.out.println("------------");

    System.out.println("numberOfSurprisingCases: " + numberOfSurprisingCases
        + " -> " + numbers);

    int countSuprisingCases = 0;
    int countGreaterAs = 0;

    for (Integer integer : numbers) {
      TripletResult tripletResult = new TripletResult(integer, higherThanThis);

      if (tripletResult.isHigherWithoutSrprise()) {
        countGreaterAs++;
      } else if ((countSuprisingCases < numberOfSurprisingCases)
          && (tripletResult.canBeHigherWithSuprise())) {
        countGreaterAs++;
        countSuprisingCases++;
      }
    }

    System.out.println("------------");
    return String.valueOf(countGreaterAs);
  }

  private static class TripletResult {

    private static final int MIN = 0;

    private static final int MAX = 10;

    public final int         result;

    public final int         higherThanThis;

    public TripletResult(int result, int higherThanThis) {
      System.out.println("New TripletResult [result=" + result
          + ",higherThanThis=" + higherThanThis + "]");

      this.result = result;
      this.higherThanThis = higherThanThis;
    }

    public boolean isHigherWithoutSrprise() {
      // 29 - 8 = 21
      // 18 = 2*9;
      if (this.result - this.higherThanThis >= (2 * (this.higherThanThis - 1))) {
        System.out.println("isHigherWithoutSrprise == true");
        return true;
      } else {
        System.out.println("isHigherWithoutSrprise == false");
        return false;
      }
    }

    public boolean canBeHigherWithSuprise() {
      // 

      if (this.result < this.higherThanThis) {
        return false;
      }

      int restOfOtherTwoNumbers = this.result - this.higherThanThis;
      int refNumber = 2 * (this.higherThanThis - 2);
      System.out.println("[restOfOtherTwoNumbers=" + restOfOtherTwoNumbers
          + ",refNumber=" + refNumber + "]");
      if (restOfOtherTwoNumbers >= refNumber) {
        System.out.println("canBeHigher ~~ true");
        return true;
      } else {
        System.out.println("canBeHigher == false");
        return false;
      }
    }
  }

  private static void writeFileAsCase(List<String> lines) {

    List<String> caseLines = new ArrayList<String>();
    for (int i = 0; i < lines.size(); i++) {
      // +1 to not print the index, but the number of the list-entry
      caseLines.add(convertToCase(i + 1, lines.get(i)));
    }

    System.out.println();
    for (String string : caseLines) {
      System.out.println(string);

    }
    writeFile(caseLines);
  }

  private static String convertToCase(int i, String string) {
    return String.format("Case #%d: %s", i, string);
  }

  private static void writeFile(List<String> lines) {

    deleteFile();

    try {
      PrintWriter writer = new PrintWriter(new FileWriter(OUTPUT_FILE));
      for (int i = 0; i < lines.size(); i++) {
        writer.print(lines.get(i));
        if (i != lines.size() - 1) {
          writer.print("\n");
        }
      }
      writer.flush();
      writer.close();
    } catch (IOException e) {
      e.printStackTrace();
    }
  }

  private static void deleteFile() {
    File file = new File(OUTPUT_FILE);
    if (file.exists()) {
      file.delete();
    }
  }

  private static List<String> readFile() {

    List<String> lines = new ArrayList<String>();

    try {
      BufferedReader in = new BufferedReader(new FileReader(INPUT_FILE));
      String str;
      while ((str = in.readLine()) != null) {
        lines.add(str);
      }
      in.close();
    } catch (IOException e) {
      e.printStackTrace();
    }
    return lines;

  }
}
