def solve():
    n,m,k = map(int,input().split())
    now = k%m
    nn = 0
    while nn < n:
        nn += 1
        nm = m-nn
        if nm <= now:
            now %= nm
        else:
            dif = nm-now
            nn += dif-1
    return now

t = int(input())
for _ in range(t):
    print(solve())