/* Problem URL: https://codeforces.com/contest/2137/problem/E */

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template <class T, class comp = less<>>
using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;

#define V vector

#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)

#define rep(i, lim) for (int i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (int i = s; i < (lim); i++)

#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;

using ll = long long;

using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;

template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
    os << vec[0];
    for (size_t i = 1; i < vec.size(); i++) {
        os << ' ' << vec[i];
    }
    os << '\n';
    return os;
}

template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
    for (auto &i : vec) {
        is >> i;
    }
    return is;
}

template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
    for (auto &i : vec) {
        os << i[0];
        for (size_t j = 1; j < i.size(); j++) {
            os << ' ' << i[j];
        }
        os << '\n';
    }
    return os;
}

template<class v>
auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
    for (auto &i : vec) {
        for (auto &j : i) {
            is >> j;
        }
    }
    return is;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t;
    cin >> t;
    while (t--) {
        ll n, k;
        cin >> n >> k;

        vl a(n);
        cin >> a;

        vi count(n + 3);

        auto simulate = [&]() {
            repv(i, a) {
                count[i]++;
            }

            int now = -1;
            while (count[now + 1] == 1) {
                now++;
            }

            int tmp = now + 1;
            while (count[tmp] > 0) {
                tmp++;
            }

            repv(i, a) {
                if (i > tmp || count[i] > 1) {
                    i = tmp;
                }
            }
        };

        simulate();

        if (k == 1) {
            cout << accumulate(all(a), 0LL) << '\n';
            continue;
        }
        k--;

        fill(all(count), 0);

        simulate();

        if (k == 1) {
            cout << accumulate(all(a), 0LL) << '\n';
            continue;
        }
        k--;

        fill(all(count), 0);
        repv(i, a) {
            count[i]++;
        }

        int now = -1;
        while (count[now + 1] == 1) {
            now++;
        }

        int tmp = now + 1;
        while (count[tmp] > 1) {
            tmp++;
        }

        ll ans = 0;
        repv(i, a) {
            if (i > now) {
                if (tmp == now + 1) {
                    ans += (k & 1) ? now + 1 : now + 2;
                } else {
                    ans += (k & 1) ? now + 2 : now + 1;
                }
                continue;
            }
            ans += i;
        }

        cout << ans << '\n';
    }
}