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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;


public class BMain {

  /**
   * @param args
   * @throws IOException 
   * @throws NumberFormatException 
   */
  public static void main(String[] args) throws IOException {
    BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
    int casesCnt = Integer.parseInt(reader.readLine());

    for (int i = 0; i < casesCnt; i++) {
      String line = reader.readLine();
      solve(i + 1, line);
    }
    
//    int[] sIdx = {0,1,2};
//    int[] sIdx = {0,3,4};
//    int[] sIdx = {};
//    int size = 5;
//    System.out.println(Arrays.toString(sIdx));
//    for (int i = 0; i < 16; i++) {
//      boolean ok = nextSurprises(sIdx, size);
//      if (!ok) break;
//      System.out.println(Arrays.toString(sIdx));
//    }
  }
  
  private static void solve(int caseN, String line) {
    final StringTokenizer tokens = new StringTokenizer(line);
    final int nGooglers = Integer.parseInt(tokens.nextToken());
    final int surprises = Integer.parseInt(tokens.nextToken());
    final int pMinScore = Integer.parseInt(tokens.nextToken());
    final int[] scores = new int[nGooglers];
    for (int i = 0; i < scores.length; i++) {
      scores[i] = Integer.parseInt(tokens.nextToken());
    }

    int result = 0;

    int[] suprIdx = initSurprises(surprises, nGooglers);
mainloop:
    do {
      int resultTmp = 0;
      boolean[] isSurprise = new boolean[nGooglers];
      for (int i : suprIdx) {
        isSurprise[i] = true;
        if (scores[i]<2)
          continue mainloop;
      }
      for (int i = 0; i < scores.length; i++) {
        for (int best = pMinScore; best <= 10; best++) {
          int tripleBest = 3 * best;
          if (isSurprise[i]) {
            // if surprise .. -2,-3,-4
            if (scores[i] <= tripleBest - 2 && scores[i] >= tripleBest - 4) {
              resultTmp++;
            }
          } else {
            // if !surprise .. sum = 3*best -0,-1,-2
            if (scores[i] <= tripleBest && scores[i] >= tripleBest - 2) {
              resultTmp++;
            }
          }
        }
      }
      if (resultTmp > result)
        result = resultTmp;
    } while (nextSurprises(suprIdx, nGooglers));
    System.out.printf("Case #%d: %d%n", caseN, result);
  }
  
  private static int[] initSurprises(int surprCnt, int googlers) {
    int [] result = new int[surprCnt];
    for (int i = 1; i < result.length; i++) {
      result[i] = result[i-1] + 1;
    }
    return result;
  }
  
  private static boolean nextSurprises(int[] sIdx, int googlers) {
    int i = sIdx.length - 1;
    boolean overflow = true;
    while (i >= 0 && overflow) {
      if (sIdx[i] >= googlers - 1 - (sIdx.length - i - 1)) {
        // overflow
        i--;
      } else {
        // no overflow
        overflow = false;
        //inc idx
        sIdx[i]++;
        // fix remaining indexes
        for (int y = i + 1; y < sIdx.length; y++) {
          sIdx[y] = sIdx[y - 1] + 1;
        }
        return true;
      }
    }
    return false;
  }
}
