120. 日期

#include <cstdio>
#include <iostream>
#include <map>
using namespace std;
int isLeap(int y) {
	if (y % 400 == 0 || (y % 100 != 0 && y % 4 == 0)) return 1;
	else return 0;
}
int mouths[13][2] = {
	0,0,
	31,31,
	28,29,
	31,31,
	30,30,
	31,31,
	30,30,
	31,31,
	31,31,
	30,30,
	31,31,
	30,30,
	31,31
};  
int main(void) {
	int n;
	scanf("%d", &n);
	while (n--) {
		int y, m, d, res = 0;
		scanf("%d:%d:%d", &y, &m, &d);
		for (int i = 1; i < m; ++i) {
			res += mouths[i][isLeap(y)];
		}
		res += d;
		printf("%d\n", res);
	}
	return 0;
}