#include <iostream>
#include <cstdint>
#include <array>
#include <vector>
#include <algorithm>

using namespace std;

static inline constexpr vector<uint32_t> solve(const uint32_t T, const vector<array<uint32_t, 5>>& monolith) noexcept
{
	vector<uint32_t> ans(T);
	for (uint32_t i = 0; i != T; ++i)
		ans[i] = *max_element(monolith[i].begin(), monolith[i].end()) - *min_element(monolith[i].begin(), monolith[i].end());
	return ans;
}

static inline void output(const uint32_t T, const vector<uint32_t>& ans) noexcept
{
	for (uint32_t i = 0; i != T; ++i)
		cout << ans[i] << '\n';
}

int main()
{
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	
	uint32_t T, i;
	cin >> T;
	vector<array<uint32_t, 5>> monolith(T);
	for (i = 0; i != T; ++i)
		for (uint32_t j = 0; j != 5; ++j)
			cin >> monolith[i][j];

	output(T, solve(T, monolith));
	return 0;
}