#1051 : 补提交卡

easy。。。

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub

		Scanner scanner = new Scanner(System.in);
		int[] a = new int[110];
		int cases = scanner.nextInt();
		while (cases-- != 0) {
			int N = scanner.nextInt();
			int M = scanner.nextInt();
			a[0] = 0;
			for (int i = 1; i <= N; i++) {
				a[i] = scanner.nextInt();
			}
			a[N+1] = 100;
			int days = getDays(a, N, M);
			System.out.println(days);
		}
	}

	private static int getDays(int[] a, int n, int m) {
		// TODO Auto-generated method stub
		if (m >= n) {
			return 100;
		}
		int maxDays = -1, days = 0;
		int start = 1, end = m;
		while(end <= n){
			days = a[end + 1] - a[start - 1] - 1;
			if (days > maxDays) {
				maxDays = days;
			}
			start++;
			end++;
		}
		return maxDays;
	}

}