import java.util.*;
import java.io.*;

public class DancingWithTheGooglers
{
    public DancingWithTheGooglers()
    {
        Scanner inFile = null;
        try
        {
            inFile = new Scanner(new File("inputB.txt"));
        }
        catch(Exception e)
        {
            System.out.println("Problem opening input file. Exiting...");
			System.exit(0);
        }
        int t = inFile.nextInt();
        
        int [] results = new int [t];
        DancingWithTheGooglersMax [] rnc = new DancingWithTheGooglersMax[t];
        
        int i, j;
        int [] scores;
        int s, p;
        for(i = 0; i < t; i++)
        {
            scores = new int [inFile.nextInt()];
            s = inFile.nextInt();
            p = inFile.nextInt();
            for(j = 0; j < scores.length; j++)
                scores[j] = inFile.nextInt();
            
            rnc[i] = new DancingWithTheGooglersMax(i, scores, s, p, results);
            rnc[i].start();
        }
        inFile.close();
        
        boolean done = false;
        
        while(!done)
        {
            done = true;
            for(i = 0; i < t; i++)
                if(rnc[i].isAlive())
                {
                    done = false;
                    break;
                }
        }
        
        PrintWriter outFile = null;
        try
        {
            outFile = new PrintWriter(new File("outputB.txt"));
        }
        catch(Exception e)
        {
            System.out.println("Problem opening output file. Exiting...");
			System.exit(0);
        }
        
        for(i = 0; i < results.length; i++)
            outFile.printf("Case #%d: %d\n", i+1, results[i]);
        outFile.close();
    }
    
    public static void main(String [] args)
    {
        new DancingWithTheGooglers();
    }
    
    private class DancingWithTheGooglersMax extends Thread
    {
        int id;
        int s, p;
        int [] results, scores;
        
        public DancingWithTheGooglersMax(int i, int [] aScores, int aS, int aP,int [] res)
        {
            id = i;
            s = aS;
            p = aP;
            results = res;
            scores = aScores;
        }
        
        public void run()
        {
            int a = 0, b = 0;
            
            if(p == 0)
                results[id] = scores.length;
            else if(p == 1)
            {
                int y;
                y = 3*p - 3;
                
                for(int i = 0; i < scores.length; i++)
                    if(scores[i] > y)
                        a++;
                    else if(scores[i] > 0)
                        b++;
                
                b = Math.min(b, s);
                results[id] = a+b;
            }
            else
            {
                int y, z;
                y = 3*p - 3;
                z = 3*p - 5;
                
                for(int i = 0; i < scores.length; i++)
                    if(scores[i] > y)
                        a++;
                    else if(scores[i] > z)
                        b++;
                
                b = Math.min(b, s);
                results[id] = a+b;
            }
        }
    }
}
import java.io.*;
import java.util.*;
import java.math.*;

public class Timus implements Runnable {
	BufferedReader in;
	PrintWriter out;
	StringTokenizer st;
	Random rnd;
	
	boolean[][][] canBe;
	int[][] d;
	int[] scores;
	
	void precalc() {
		canBe = new boolean[30 + 1][10 + 1][2];
		
		for(int a = 0; a <= 10; a++) {
			for(int b = 0; b <= 10; b++) {
				for(int c = 0; c <= 10; c++) {
					int sum = a + b + c, max = Math.max(a, Math.max(b, c));
					int maxDiff = Math.max(Math.abs(a - b), Math.max(Math.abs(a - c), Math.abs(b - c)));
					int flag = 0;
					
					if(maxDiff > 2) {
						continue;
					} else if(maxDiff == 2) {
						flag = 1;
					}
					
					for(int lower = 0; lower <= max; lower++) {
						canBe[sum][lower][flag] = true;
					}
				}
			}
		}
	}
	
	int solveOne(int n, int s, int p) throws IOException {
		d = new int[n + 1][s + 1];
		
		for(int i = 0; i < d.length; i++) {
			Arrays.fill(d[i], Integer.MIN_VALUE / 2);
		}
		
		d[0][0] = 0;
		
		scores = new int[n];
		
		for(int i = 0; i < n; i++) {
			scores[i] = nextInt();
		}
		
		for(int i = 0; i < n; i++) {
			int curScore = scores[i];
			
			for(int j = 0; j <= s; j++) {
				if(canBe[curScore][p][0]) {
					d[i + 1][j] = Math.max(d[i + 1][j], d[i][j] + 1);
				} else {
					d[i + 1][j] = Math.max(d[i + 1][j], d[i][j]);
				}
				
				if(j < s) {
					
					if(canBe[curScore][p][1]) {
						d[i + 1][j + 1] = Math.max(d[i + 1][j + 1], d[i][j] + 1);
					} else {
						d[i + 1][j + 1] = Math.max(d[i + 1][j + 1], d[i][j]);
					}
					
					
				}
			}
		}
		
		return d[n][s];
	}
	
	void solve() throws IOException {
		precalc();
		
		int tests = nextInt();
		
		for(int test = 1; test <= tests; test++) {
			out.printf("Case #%d: %d\n", test, solveOne(nextInt(), nextInt(), nextInt()));
		}
	}

	public static void main(String[] args) {
		new Timus().run();
	}

	public void run() {
		try {
			in = new BufferedReader(new InputStreamReader(System.in));
			out = new PrintWriter(System.out);

			rnd = new Random();

			solve();

			out.close();
		} catch (IOException e) {
			e.printStackTrace();
			System.exit(42);
		}
	}

	String nextToken() throws IOException {
		while (st == null || !st.hasMoreTokens()) {
			String line = in.readLine();

			if (line == null) {
				return null;
			}

			st = new StringTokenizer(line);
		}

		return st.nextToken();
	}

	int nextInt() throws IOException {
		return Integer.parseInt(nextToken());
	}

	long nextLong() throws IOException {
		return Long.parseLong(nextToken());
	}

	double nextDouble() throws IOException {
		return Double.parseDouble(nextToken());
	}
}