#include <iostream>
using namespace std;
void calc_table(int f[], int n, int k){
int sum = 0;
for(int i = 0; i<n; i++){
for(int j=i+1; j<n; j++){
sum+=1;
}
}
cout<<sum<<"\n"; // check if it is equal to kn
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t; // no. of test cases
for(int j=0; j<t; j++){
int n; // size of domain of f
int k; // no. of steps
int f[10000];
cin >> n >> k;
for(int i=0; i<n; i++){
cin >> f[i];
}
cout<<n*k<<"\n";
calc_table(f, n, k);
}
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKdm9pZCBjYWxjX3RhYmxlKGludCBmW10sIGludCBuLCBpbnQgayl7CglpbnQgc3VtID0gMDsKCWZvcihpbnQgaSA9IDA7IGk8bjsgaSsrKXsKCQlmb3IoaW50IGo9aSsxOyBqPG47IGorKyl7CgkJCXN1bSs9MTsKCQl9Cgl9Cgljb3V0PDxzdW08PCJcbiI7IC8vIGNoZWNrIGlmIGl0IGlzIGVxdWFsIHRvIGtuCn0KCmludCBtYWluKCkgewoJaW9zX2Jhc2U6OnN5bmNfd2l0aF9zdGRpbyhmYWxzZSk7IAogICAgY2luLnRpZShOVUxMKTsgICAgCiAgICAgICAKICAgIGludCB0OwogICAgY2luID4+IHQ7CS8vIG5vLiBvZiB0ZXN0IGNhc2VzCiAgICAgZm9yKGludCBqPTA7IGo8dDsgaisrKXsKICAgIAlpbnQgbjsJLy8gc2l6ZSBvZiBkb21haW4gb2YgZgogICAgCWludCBrOwkvLyBuby4gb2Ygc3RlcHMKICAgIAlpbnQgZlsxMDAwMF07CiAgICAJY2luID4+IG4gPj4gazsgCiAgICAJZm9yKGludCBpPTA7IGk8bjsgaSsrKXsKICAgIAkJY2luID4+IGZbaV07CiAgICAJfQogICAgCWNvdXQ8PG4qazw8IlxuIjsKICAgIAljYWxjX3RhYmxlKGYsIG4sIGspOwogICAgIH0KCQoJcmV0dXJuIDA7Cn0=