#include <iostream>
using namespace std;

struct Point {
    long long y, x;
};

Point ps[100001];

long long _abs(long long a) {
    return a > 0 ? a : -a;
}

long long _max(long long a, long long b) {
    return a > b ? a : b;
}

long long getArea(Point s, Point a, Point b) {
    return _abs((a.y - s.y)*(b.x - s.x) - (b.y - s.y)*(a.x - s.x));
}

long long D[101][101][101];

long long solve(int start, int still, int cnt, int N) {

    long long &ret = D[start][still][cnt];
    if (ret != 0) {
        return ret;
    }

    if (cnt <= 0) return 0;


    int i = start + 1;

    while (i != still) {
        long long area = getArea(ps[start], ps[i], ps[still]);
        ret = _max(ret, solve(start, i, cnt - 1, N) + area);
        i = (i + 1) % N;
    }

    return ret;
//    cout << ret << endl;
}

int main() {
    int T;
    cin >> T;

    for (int t = 1; t <= T; t++) {
        int n, k;
        cin >> n >> k;

        for (int i = 0; i < 101; i++) {
            for (int j = 0; j < 101; j++) {
                for (int k = 0; k < 101; k++) {
                    D[i][j][k] = 0;
                }
            }
        }

        for (int i = 0; i < n; i++) cin >> ps[i].x >> ps[i].y;

        long long ans = 0;
        for (int i = 0; i < n; i++) {
            int j = i + 1;
            while (j != i) {
                ans = _max(ans, solve(i, j, k-2, n));
                j = (j + 1) % n;
            }
        }

        cout << "#" << t << " ";
        cout << ans << endl;
    }

    return 0;
}