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.BufferedWriter;
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;


public class Dancers {
	
	public static void main(final String[] args) throws IOException {
		if (args.length < 2) {
			System.out.println("Input and output file must be given");
			return;
		}
		
		PrintWriter pw = null;
		try {
			pw = new PrintWriter(new BufferedWriter(new FileWriter(args[1])));
			final List<TestCase> cases = parseInput(args[0]);
			for(final TestCase test : cases) {
				pw.println("Case #" + test.getCaseNum() + ": " + test.solve());
			}
		} finally {
			if(pw != null) {
				pw.close();
			}
		}
	}
	
	private static List<TestCase> parseInput(String filename) throws IOException {
		final List<TestCase> res = new ArrayList<TestCase>();
		BufferedReader br = null;
		try {
			br = new BufferedReader(new FileReader(filename));
			int caseNum = Integer.parseInt(br.readLine());
			for(int i = 0; i < caseNum; ++i) {
				String[] args = br.readLine().split("\\s");
				int n = Integer.parseInt(args[0]);
				int s = Integer.parseInt(args[1]);
				int p = Integer.parseInt(args[2]);
				int [] scores = new int[n];
				for(int j = 0; j < n; ++j) {
					scores[j] = Integer.parseInt(args[3 + j]);
				}
				res.add(new TestCase(i + 1, n, s, p, scores));
			}
		} finally {
			if(br != null) {
				br.close();
			}
		}
		return res;
	}

	private static class TestCase {
		private int caseNum;
		private int numberOfGooglers;
		private int suprisingTriplets;
		private int minBestResult;
		private int[] scores;
		
		public TestCase(int caseNum, int numberOfGooglers,
				int suprisingTriplets, int minBestResult, int[] scores) {
			super();
			this.caseNum = caseNum;
			this.numberOfGooglers = numberOfGooglers;
			this.suprisingTriplets = suprisingTriplets;
			this.minBestResult = minBestResult;
			this.scores = scores;
		}

		public int solve() {
			int res = 0;
			int [] x = new int[suprisingTriplets];
			for(int i = 0; i < suprisingTriplets; ++i) {
				x[i] = i;
			}
			
			while(true) {
				int maxGooglersForPermutation = countMaxGooglersForPermutation(x);
				res = Math.max(res, maxGooglersForPermutation);
				if(!nextPermutation(x)) {
					break;
				}
			}
			return res;
		}

		private boolean nextPermutation(int[] x) {
			int k = -1;
			for(int i = suprisingTriplets - 1; i >= 0; --i) {
				if(x[i] < numberOfGooglers + suprisingTriplets - i) {
					k = i;
					break;
				}
			}
			if(k >= 0) {
				x[k]++;
				for(int i = k + 1; i < suprisingTriplets; ++i) {
					x[i] = x[k] + i - k;
				}
			}
			return k >= 0;
		}

		private int countMaxGooglersForPermutation(int[] arr) {
			List<Integer> x = new ArrayList<Integer>();
			for(int i = 0; i < suprisingTriplets; ++i) {
				x.add(arr[i]);
			}
			int res = 0;
			for(int i = 0; i < numberOfGooglers; ++i) {
				int score = scores[i];
				int maxForGoogler = -1;
				if(x.contains(i)) {
					maxForGoogler = countMaxForSuprising(score);
				} else {
					maxForGoogler = countMaxForNotSuprising(score);
				}
				if(maxForGoogler >= minBestResult) {
					++res;
				}
			}
			return res;
		}

		private int countMaxForNotSuprising(int score) {
			if(score % 3 == 0) {
				return score / 3;
			} else if(score % 3 == 1) {
				return ((score - 1) / 3) + 1;
			} else {
				return ((score - 2) / 3) + 1;
			}
		}

		private int countMaxForSuprising(int score) {
			if(score % 3 == 0) {
				return score == 0 ? -1 : ((score - 3) / 3) + 2;
			} else if(score % 3 == 1) {
				return score == 1 ? -1 : ((score - 4) / 3) + 2;
			} else {
				return ((score - 2) / 3) + 2;
			}
		}

		public int getCaseNum() {
			return caseNum;
		}

	}
}
