#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int operations = 0;
int target = h[n - 1]; // Start from the last pillar
for (int i = n - 2; i >= 0; i--) {
if (h[i] > target) {
operations += (h[i] - target);
} else {
target = h[i];
}
}
cout << operations << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--) {
solve();
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgp2b2lkIHNvbHZlKCkgewogICAgaW50IG47CiAgICBjaW4gPj4gbjsKICAgIHZlY3RvcjxpbnQ+IGgobik7CiAgICBmb3IgKGludCBpID0gMDsgaSA8IG47IGkrKykgewogICAgICAgIGNpbiA+PiBoW2ldOwogICAgfQoKICAgIGludCBvcGVyYXRpb25zID0gMDsKICAgIGludCB0YXJnZXQgPSBoW24gLSAxXTsgLy8gU3RhcnQgZnJvbSB0aGUgbGFzdCBwaWxsYXIKCiAgICBmb3IgKGludCBpID0gbiAtIDI7IGkgPj0gMDsgaS0tKSB7CiAgICAgICAgaWYgKGhbaV0gPiB0YXJnZXQpIHsKICAgICAgICAgICAgb3BlcmF0aW9ucyArPSAoaFtpXSAtIHRhcmdldCk7CiAgICAgICAgfSBlbHNlIHsKICAgICAgICAgICAgdGFyZ2V0ID0gaFtpXTsKICAgICAgICB9CiAgICB9CgogICAgY291dCA8PCBvcGVyYXRpb25zIDw8IGVuZGw7Cn0KCmludCBtYWluKCkgewogICAgaW9zOjpzeW5jX3dpdGhfc3RkaW8oZmFsc2UpOwogICAgY2luLnRpZShudWxscHRyKTsKCiAgICBpbnQgdDsKICAgIGNpbiA+PiB0OwogICAgd2hpbGUgKHQtLSkgewogICAgICAgIHNvbHZlKCk7CiAgICB9CgogICAgcmV0dXJuIDA7Cn0=