import std.stdio, std.conv, std.functional, std.string; import std.algorithm, std.array, std.container, std.range, std.typecons; import std.bigint, std.numeric, std.math, std.random; import core.bitop; string FMT_F = "%.10f"; static File _f; void file_io(string fn) { _f = File(fn, "r"); } static string[] s_rd; T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; } T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; } T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; } T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; } T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; } T[] RDA(T = long)(T fix = 0) { if (_f.isOpen) return _RDA!T(_f, fix); else return _RDA!T(fix); } size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;} size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; } void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); } bool inside(T)(T x, T b, T e) { return x >= b && x < e; } long lcm(long x, long y) { return x * (y / gcd(x, y)); } long mod = 10^^9 + 7; //long mod = 998244353; //long mod = 1_000_003; void moda(ref long x, long y) { x = (x + y) % mod; } void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; } void modm(ref long x, long y) { x = (x * y) % mod; } void modpow(ref long x, long y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); } void main() { auto T = RD; auto ans = new long[](T); foreach (ti; 0..T) { auto A = RD; auto B = RD; auto C = RD; if ((A > B && A < C) || (A < B && A > C)) continue; if ((C > B && C < A) || (C < B && C > A)) continue; if ((A == 1 && B == 2) || (C == 1 && B == 2)) { ans[ti] = -1; continue; } if (A <= 2 && B <= 2 && C <= 2) { ans[ti] = -1; continue; } if ((A == 1 && C == 1) || (A == 1 && B == 1) || (C == 1 && B == 1)) { ans[ti] = -1; continue; } long t = long.max; if (A < C) { if (A != 1) t.chmin(B - A + 1); if (B != 1) { if (A == B-1) t.chmin(C - B + 2); else t.chmin(C - B + 1); } } else if (A > C) { if (C != 1) t.chmin(B - C + 1); if (B != 1) { if (C == B-1) t.chmin(A - B + 2); else t.chmin(A - B + 1); } } else { if (A < B) t.chmin(1); else if (A == B+1) t.chmin(2); else if (A == B) t.chmin(3); else t.chmin(1); } ans[ti] = t; } foreach (e; ans) writeln(e); stdout.flush; debug readln; }