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

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package first;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Collection;
import java.util.HashMap;
import java.util.Map;
import java.util.TreeMap;

/**
 *
 * @author tal
 */
public class Second {

    public static final int MAX_NUMBER = 11;
    public static Map<Integer, Map<Collection<Integer>, Boolean>> fullLearnedMap;

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) throws IOException {
        fullLearnedMap = learn();
        InputStreamReader converter = new InputStreamReader(System.in);
        BufferedReader in = new BufferedReader(converter);

        String readLine = in.readLine();
        int n = Integer.parseInt(readLine);
        for (int i = 0; n > 0; i++) {
            String caseText = in.readLine();
            if (caseText == null || caseText.isEmpty()) {
                break;
            }
            System.out.println("Case #" + (i + 1) + ": " + maxPoints(caseText));
            n--;
        }
        in.close();
    }

    public static Map<Integer, Map<Collection<Integer>, Boolean>> learn() {
        Map<Integer, Map<Collection<Integer>, Boolean>> map = new TreeMap<Integer, Map<Collection<Integer>, Boolean>>();
        int N = 0;
        for (int i = 0; i < MAX_NUMBER; i++) {
            for (int j = i; j < MAX_NUMBER; j++) {
                for (int k = j; k < MAX_NUMBER; k++) {
                    if (Math.abs(i - j) > 2 || Math.abs(i - k) > 2 || Math.abs(j - k) > 2) {
                        continue;
                    }
                    int sum = i + j + k;
                    Map<Collection<Integer>, Boolean> triples = map.get(sum);
                    Boolean surprise = false;
                    if (Math.abs(i - j) > 1 || Math.abs(i - k) > 1 || Math.abs(j - k) > 1) {
                        surprise = true;
                    }
                    Integer[] triple = {i, j, k};
                    if (triples == null) {
                        triples = new HashMap<Collection<Integer>, Boolean>();
                        map.put(sum, triples);
                    }
                    triples.put(Arrays.asList(triple), surprise);
                    N++;
                }
            }
        }
        //System.out.println("Total: " + N);
        return map;
    }

    public static Integer maxPoints(String input) {
        String[] split = input.split(" ");
        int N = Integer.parseInt(split[0]);
        int S = Integer.parseInt(split[1]);
        int p = Integer.parseInt(split[2]);
        int[] dancersScores = new int[N];
        for (int i = 3; i < 3 + N; i++) {
            dancersScores[i - 3] = Integer.parseInt(split[i]);
        }
        return findMaxRec(dancersScores, p, S);
    }

    public static Integer findMaxRec(int[] reducedDancersScores, Integer p, Integer S) {
        if (reducedDancersScores == null || reducedDancersScores.length == 0 || S < 0) {
            return 0;
        }
        int localMax = 0;
        int[] copyOfRange;
        if (reducedDancersScores.length == 1) {
            copyOfRange = null;
        } else {
            copyOfRange = Arrays.copyOfRange(reducedDancersScores, 1, reducedDancersScores.length);
        }
        Map<Collection<Integer>, Boolean> triples = fullLearnedMap.get(reducedDancersScores[0]);
        for (Map.Entry<Collection<Integer>, Boolean> triple : triples.entrySet()) {
            if (relevantTriple(triple.getKey(), p)) {
                if (triple.getValue()) {
                    if (S > 0) {
                        Integer foundMaxOnSubset = findMaxRec(copyOfRange, p, S - 1); // recursive call
                        if (localMax < 1 + foundMaxOnSubset) {
                            localMax = 1 + foundMaxOnSubset;
                        }
                    } else {
                        continue;
                    }
                } else {
                    Integer foundMaxOnSubset = findMaxRec(copyOfRange, p, S); // recursive call
                    if (localMax < 1 + foundMaxOnSubset) {
                        localMax = 1 + foundMaxOnSubset;
                    }

                }
            }
        }
        Integer foundMaxRec = findMaxRec(copyOfRange, p, S);
        if (localMax < foundMaxRec) {
            localMax = foundMaxRec;
        }

        return localMax;
    }

    public static boolean relevantTriple(Collection<Integer> triple, int min) {
        for (Integer judgeScore : triple) {
            if (judgeScore >= min) {
                return true;
            }
        }
        return false;
    }
}
