#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
 
int main() {
    int t;
    cin >> t;
 
    while (t--) {
        int n, k;
        cin >> n >> k;
 
        vector<int> a(n);
 
        for (int i = 0; i < n; i++) {
            cin >> a[i];
        }
 
        int i = 0;
        ll ans = 0;
        ll prev = -1;
 
        while (i < n) {
            int j = i;
 
            // Find group of equal elements
            while (j < n && a[i] == a[j]) {
                j++;
            }
 
            // First value that this group can take
            ll st = max(prev + 1, (ll)a[i]);
 
            // Assign consecutive values
            for (int p = i; p < j; p++) {
                ll fin = st + (p - i);
 
                ans += fin - a[i];
 
                prev = fin;
            }
 
            i = j;
        }
 
        cout << ans << endl;
    }
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgp1c2luZyBsbCA9IGxvbmcgbG9uZzsKCmludCBtYWluKCkgewogICAgaW50IHQ7CiAgICBjaW4gPj4gdDsKCiAgICB3aGlsZSAodC0tKSB7CiAgICAgICAgaW50IG4sIGs7CiAgICAgICAgY2luID4+IG4gPj4gazsKCiAgICAgICAgdmVjdG9yPGludD4gYShuKTsKCiAgICAgICAgZm9yIChpbnQgaSA9IDA7IGkgPCBuOyBpKyspIHsKICAgICAgICAgICAgY2luID4+IGFbaV07CiAgICAgICAgfQoKICAgICAgICBpbnQgaSA9IDA7CiAgICAgICAgbGwgYW5zID0gMDsKICAgICAgICBsbCBwcmV2ID0gLTE7CgogICAgICAgIHdoaWxlIChpIDwgbikgewogICAgICAgICAgICBpbnQgaiA9IGk7CgogICAgICAgICAgICAvLyBGaW5kIGdyb3VwIG9mIGVxdWFsIGVsZW1lbnRzCiAgICAgICAgICAgIHdoaWxlIChqIDwgbiAmJiBhW2ldID09IGFbal0pIHsKICAgICAgICAgICAgICAgIGorKzsKICAgICAgICAgICAgfQoKICAgICAgICAgICAgLy8gRmlyc3QgdmFsdWUgdGhhdCB0aGlzIGdyb3VwIGNhbiB0YWtlCiAgICAgICAgICAgIGxsIHN0ID0gbWF4KHByZXYgKyAxLCAobGwpYVtpXSk7CgogICAgICAgICAgICAvLyBBc3NpZ24gY29uc2VjdXRpdmUgdmFsdWVzCiAgICAgICAgICAgIGZvciAoaW50IHAgPSBpOyBwIDwgajsgcCsrKSB7CiAgICAgICAgICAgICAgICBsbCBmaW4gPSBzdCArIChwIC0gaSk7CgogICAgICAgICAgICAgICAgYW5zICs9IGZpbiAtIGFbaV07CgogICAgICAgICAgICAgICAgcHJldiA9IGZpbjsKICAgICAgICAgICAgfQoKICAgICAgICAgICAgaSA9IGo7CiAgICAgICAgfQoKICAgICAgICBjb3V0IDw8IGFucyA8PCBlbmRsOwogICAgfQp9

NAoyIDEKMiAxCjQgMgoxIDEgMSAxCjYgMwoxIDMgMiAzIDIgMwo3IDQKMSA1IDIgMiA1IDUgMQ==

4
2 1
2 1
4 2
1 1 1 1
6 3
1 3 2 3 2 3
7 4
1 5 2 2 5 5 1