## Algorithm

A. Minutes Before the New Year
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

New Year is coming and you are excited to know how many minutes remain before the New Year. You know that currently the clock shows h hours and m minutes, where 0hh<240≤ℎℎ<24 and 0mm<600≤��<60We use 24-hour time format!

Your task is to find the number of minutes before the New Year. You know that New Year comes when the clock shows 00 hours and 00 minutes.

You have to answer t independent test cases.

Input

The first line of the input contains one integer t (1t14391≤�≤1439) — the number of test cases.

The following t lines describe test cases. The i-th line contains the time as two integers h and m (0h<240≤ℎ<240m<600≤�<60). It is guaranteed that this time is not a midnight, i.e. the following two conditions can't be met at the same time: h=0ℎ=0 and m=0�=0. It is guaranteed that both h and m are given without leading zeros.

Output

For each test case, print the answer on it — the number of minutes before the New Year.

Example
input
Copy
5
23 55
23 0
0 1
4 20
23 59

output
Copy
5
60
1439
1180
1


## Code Examples

### #1 Code Example with C++ Programming

Code - C++ Programming

#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define endl '\n'
#define debug(n) cout<<(n)<<endl;
const ll INF = 2e18 + 99;

int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);

int t;
cin<<t;
int h, m;
while(t--){
cin<<h;
cin<<m;
cout<<(1440 - (h * 60) - m)<<endl;
}
}
Copy The Code &

Input

cmd
5
23 55
23 0
0 1
4 20
23 59

Output

cmd
5
60
1439
1180
1