// Arup Guha
// 10/14/2015
// Solution to 2000 UCF HS Contest Problem: These Are Odd Days We Live In

import java.util.*;

public class days {

	final public static int[] NUMDAYS = {31,28,31,30,31,30,31,31,30,31,30,31};

	public static void main(String[] args) {

		Scanner stdin = new Scanner(System.in);
		int numCases = stdin.nextInt();

		// Process each case.
		for (int loop=1; loop<=numCases; loop++) {

			StringTokenizer tok = new StringTokenizer(stdin.next(), "/");
			int[] date = new int[3];
			date[1] = Integer.parseInt(tok.nextToken());
			date[0] = Integer.parseInt(tok.nextToken());
			date[2] = Integer.parseInt(tok.nextToken());

			// Just iterate, it won't take that long...
			int cnt = 0;
			do {
				cnt++;
				advance(date);
			} while (!odd(date));

			// Print the result.
			System.out.println(cnt);
		}
	}

	// Returns true iff every item in nums only contains odd digits.
	public static boolean odd(int[] nums) {

		// Try each item.
		for (int i=0; i<nums.length; i++) {
			int n = nums[i];

			// Peel off each digit and check.
			while (n > 0) {
				if ((n%10)%2 == 0) return false;
				n /= 10;
			}
		}
		return true;
	}

	public static void advance(int[] date) {

		// Easy stay in the same month.
		if (date[0] < NUMDAYS[date[1]-1]) {
			date[0]++;
			return;
		}

		// Go to the next month.
		if (date[1] < 12) {
			date[1]++;
			date[0] = 1;
			return;
		}

		// New Year's Day is next!
		date[2]++;
		date[0] = 1;
		date[1] = 1;
	}
}