#include <cassert>
#include <cstdio>
#include <algorithm>

using namespace std;

long long n1, n2, m, tn;

void validate () {
    assert(0 <= m && m <= 1000000000);
    assert(0 <= n1 && n1 <= 1000000000000000000LL);
    assert(0 <= n2 && n2 <= 1000000000000000000LL);
}

int main(int argc, const char * argv[]) {
    scanf("%lld\n", &tn);
    assert(1 <= tn && tn <= 100000);
    while (tn--) {
        scanf("%lld %lld %lld\n", &n1, &n2, &m);
        validate();
        printf("%lld\n", n1 + n2 - 2LL * min(1LL * min(n1, n2), m * 1LL * (m + 1LL) / 2LL));
    }
    return 0;
}