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

public class P {

   public static void main(String[] arg) { 

      //greedyPossibleTuple(new int[] {29,20,8,18, 18,21},8,2);
      //greedyPossibleTuple(new int[] {8,0}, 1,1);
      //greedyPossibleTuple(new int[] {23, 22, 21, 20, 29}, 8, 0);
      //System.out.println(parseLine("6 2 8 29 20 8 18 18 21"));

      java.io.BufferedReader in = new java.io.BufferedReader(new java.io.InputStreamReader(System.in));
      try {
         String line;
         java.util.ArrayList<String> lines = new java.util.ArrayList<String>();
         while((line = in.readLine())!=null) {
              lines.add(line);
         }

         for(int i=1;i<lines.size();i++) {
              line = lines.get(i);
              System.out.println("Case #"+i+": "+parseLine(line));
         }

      } catch(Exception e) {
      }      
   }

   public static String parseLine(String l) {
      String[] pt = l.split(" "); 
      int N = Integer.valueOf(pt[0]);
      int S = Integer.valueOf(pt[1]);
      int p = Integer.valueOf(pt[2]);

      int t[] = new int[N];
      for(int i=3;i<pt.length;i++) {
          t[i-3]=Integer.valueOf(pt[i]); 
      }

      //System.out.println("AAA:"+p + "," +S+","+N); 
      return ""+greedyPossibleTuple(t, p, S); 
   }

   public static int greedyPossibleTuple(int[] data, int least, int maxsup) {
      boolean marker[] = new boolean[data.length];

      int scount = 0;
      for(int i=0;i<data.length;i++) {
           marker[i] = false;
           int m = computeTuple(data[i], true);
           if(m>=least) {
              scount++;
              marker[i]=true;
              //System.out.println("S:"+data[i]+","+m);
           }
      }

      int count = scount;
      for(int i=0;i<data.length;i++) {
           int m = computeTuple(data[i], false);
           if(m >= least) {
               //System.out.println("A:"+data[i]);
               if(marker[i]) {
                  scount--;
               } else {
                  marker[i] = true;
                  count++;
               }
           }
      }

      if(scount > maxsup) {
          count -= (scount - maxsup );
      }
      //System.out.println(count + "," +scount + "," + maxsup);

      //System.out.println("....");

      return count;
   }

   public static int computeTuple(int a, boolean s) {
      int min = (int)Math.floor((double)a/3);

      int g = s?2:1;
      int[] mines = {min, min, min};

      int i=0;
      int j=1;
     
      if(mines[0]+mines[1]+mines[2] == a && g<a) {
         mines[0]+=g-1;
         mines[2]-=g-1;
      }
 
      while(mines[0] + mines[1] + mines[2] < a) {
         mines[i]++;
         if(j%g==0) {
             i++;

             if(i>g) i=0;
         }
         j++;
      } 

      //System.out.println(mines[0]); 
      return mines[0];
   }
}
