#include <bits/stdc++.h>

using namespace std;

int main() {
#ifdef _DEBUG
	freopen("input.txt", "r", stdin);
//	freopen("output.txt", "w", stdout);
#endif
	
	int q;
	scanf("%d", &q);
	for (int i = 0; i < q; ++i) {
		int h, m;
		scanf("%d %d", &h, &m);
		printf("%d\n", 1440 - h * 60 - m);
	}
	
	return 0;
}

#include <bits/stdc++.h>

using namespace std;

int main() {
#ifdef _DEBUG
	freopen("input.txt", "r", stdin);
//	freopen("output.txt", "w", stdout);
#endif
	
	int q;
	cin >> q;
	for (int i = 0; i < q; ++i) {
		int n, k;
		cin >> n >> k;
		int full = n - n % k;
		full += min(n % k, k / 2);
		cout << full << endl;
	}
	
	return 0;
}

#include <bits/stdc++.h>

using namespace std;

int main() {
#ifdef _DEBUG
	freopen("input.txt", "r", stdin);
//	freopen("output.txt", "w", stdout);
#endif
	
	int n;
	cin >> n;
	vector<int> f(n);
	vector<int> in(n), out(n);
	for (int i = 0; i < n; ++i) {
		cin >> f[i];
		--f[i];
		if (f[i] != -1) {
			++out[i];
			++in[f[i]];
		}
	}
	
	vector<int> loops;
	for (int i = 0; i < n; ++i) {
		if (in[i] == 0 && out[i] == 0) {
			loops.push_back(i);
		}
	}
	if (loops.size() == 1) {
		int idx = loops[0];
		for (int i = 0; i < n; ++i) {
			if (in[i] == 0 && i != idx) {
				f[idx] = i;
				++out[idx];
				++in[i];
				break;
			}
		}
	} else if (loops.size() > 1) {
		for (int i = 0; i < int(loops.size()); ++i) {
			int cur = loops[i];
			int nxt = loops[(i + 1) % int(loops.size())];
			f[cur] = nxt;
			++out[cur];
			++in[nxt];
		}
	}
	loops.clear();
	vector<int> ins, outs;
	for (int i = 0; i < n; ++i) {
		if (in[i] == 0) ins.push_back(i);
		if (out[i] == 0) outs.push_back(i);
	}
	assert(ins.size() == outs.size());
	for (int i = 0; i < int(outs.size()); ++i) {
		f[outs[i]] = ins[i];
	}
	
	for (int i = 0; i < n; ++i) {
		cout << f[i] + 1 << " ";
	}
	cout << endl;
	
	return 0;
}

#include <bits/stdc++.h>

using namespace std;

mt19937 rnd(time(NULL));

int main() {
#ifdef _DEBUG
	freopen("input.txt", "r", stdin);
//	freopen("output.txt", "w", stdout);
#endif
	
	int n, m;
	cin >> n >> m;
	vector<int> x(n);
	for (int i = 0; i < n; ++i) {
		cin >> x[i];
	}
	queue<int> q;
	map<int, int> d;
	for (int i = 0; i < n; ++i) {
		d[x[i]] = 0;
		q.push(x[i]);
	}
	long long ans = 0;
	vector<int> res;
	while (!q.empty()) {
		if (int(res.size()) == m) break;
		int cur = q.front();
		q.pop();
		if (d[cur] != 0) {
			ans += d[cur];
			res.push_back(cur);
		}
		if (!d.count(cur - 1)) {
			d[cur - 1] = d[cur] + 1;
			q.push(cur - 1);
		}
		if (!d.count(cur + 1)) {
			d[cur + 1] = d[cur] + 1;
			q.push(cur + 1);
		}
	}
	cout << ans << endl;
	shuffle(res.begin(), res.end(), rnd);
	for (auto it : res) cout << it << " ";
	cout << endl;
	
	return 0;
}

#include <bits/stdc++.h>

#define forn(i, n) for (int i = 0; i < int(n); i++)

using namespace std;

int n;
vector<int> a, cnt;

int solvemin(){
	int res = 0;
	forn(i, n){
		if (!cnt[i]) continue;
		++res;
		i += 2;
	}
	return res;
}

int solvemax(){
	int res = 0;
	int dist = 2;
	bool right = false;
	forn(i, n){
		if (!cnt[i]){
			++dist;
			continue;
		}
		int j = i - 1;
		int sum = 0;
		while (j + 1 < n && cnt[j + 1]){
			++j;
			sum += cnt[j];
		}
		res += (j - i + 1);
		if (sum > j - i + 1 && (!right || dist > 1)){
			--sum;
			++res;
		}
		right = false;
		if (sum > j - i + 1){
			right = true;
			++res;
		}
		i = j;
		dist = 0;
	}
	return res;
}

int main() {
	scanf("%d", &n);
	a.resize(n);
	cnt.resize(n + 1);
	forn(i, n){
		scanf("%d", &a[i]);
		++cnt[a[i] - 1];
	}
	printf("%d %d\n", solvemin(), solvemax());
	return 0;
}

#define _CRT_SECURE_NO_WARNINGS

#include<cstdio>
#include<vector>
#include<algorithm>

using namespace std;

int main()
{
	int n;
	scanf("%d", &n);
	vector<int> a(n - 1);
	for (int i = 0; i < n - 1; i++)
	{
		scanf("%d", &a[i]);
		a[i]--;
	}
	int root = a[0];
	int last = -1;
	vector<int> used(n, 0);
	printf("%d\n", root + 1);
	int cur = n - 1;
	for (int i = 0; i < n - 1; i++)
	{
		used[a[i]] = 1;
		while (used[cur])
			cur--;
		if (i == n - 2 || used[a[i + 1]])
		{
			printf("%d %d\n", a[i] + 1, cur + 1);
			used[cur] = 1;
		}
		else
			printf("%d %d\n", a[i + 1] + 1, a[i] + 1);
	}
	return 0;
}