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

import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.PrintWriter;
import java.util.Scanner;

class Solution {
    private final String FILE_IN = "B-small-attempt0.in";
    private final String FILE_OUT = "B-small-attempt0.out";
    
    private final Scanner mScanner;
    private final PrintWriter mOut;

    private final boolean perm[] = new boolean[101];
    
    public Solution() throws FileNotFoundException {
        mScanner = new Scanner(new FileInputStream(FILE_IN));
        mOut = new PrintWriter(new FileOutputStream(FILE_OUT));
    }
    
    public void closeFiles() {
        mScanner.close();
        mOut.close();
    }
    
    static private boolean canHaveP(int summ, int p, boolean s) {

        int modulo = summ % 3;
        int div = summ / 3;
        
        if (modulo == 0) {
            return div + ((s) ? ((summ >= 1) ? 1 : 0) : 0) >= p;
        }

        if (modulo == 1) {
            return div + ((summ >= 1) ? 1 : 0) >= p;
        } else {
            int max = div;
            if (s && summ >= 2) {
                max += 2;
            } else if (summ >= 1) {
                max += 1;
            }
            
            return max >= p;
        }
    }
    
    private boolean nextPerm(int n) {
        int trues = 0;
        for (int i = 0; i < n - 1; i++) {
            if (!perm[i]) {
                continue;
            }
            if (!perm[i + 1]) {
                perm[i + 1] = true;
                
                for (int j = 0; j <= i; j++) {
                    perm[j] = j < trues;
                }
                return true;
            } else {
                trues++;
            }
        }
        
        return false;
    }
    
    void solve(int caseId, int n, int s, int p, int[] ti) {
        for (int i = 0; i < n + 1; i++) {
            perm[i] = i < s;
        }
        
        int maxSurprises = 0;
        do {
            int surprises = 0;
            for (int i = 0; i < n; i++) {
                if (canHaveP(ti[i], p, perm[i])) {
                    surprises++;
                }
            }
            if (surprises > maxSurprises) {
                maxSurprises = surprises;
            }
            
        } while (nextPerm(n));

        mOut.println("Case #" + (caseId + 1) + ": " + maxSurprises);
    }
    
    Solution run() {
        int t = mScanner.nextInt();
        mScanner.nextLine();

        int[] ti = new int[100];
        
        for (int i = 0; i < t; i++) {
            int n = mScanner.nextInt();
            int s = mScanner.nextInt();
            int p = mScanner.nextInt();
            
            for (int j = 0; j < n; j++) {
                ti[j] = mScanner.nextInt();
            }
            if (mScanner.hasNext()) {
                mScanner.nextLine();
            }

            solve(i, n, s, p, ti);
        }
        return this;
    }
}


public class Main {
    public static void main(String[] args) throws FileNotFoundException {
        new Solution().run().closeFiles();
    }
}
