Time

A time point is given as six integers $y, m, d, h, \mathit{min}, s$ standing for year, month, day, hour, minute, and second, with $1970 \le y < 2030$, $0 < m < 13$, $0 < d < 32$, $0 \le h < 24$, $0 \le \mathit{min} < 60$, and $0 \le s < 60$.

Write a program that computes how many periods of a given length fit between two given time points. A period is given by a pair consisting of a positive integer and a word naming a time unit, one of year, month, day, hour, minute, or second.

Every 4th year is a leap year, except every 100th year, which is not, except every 400th year, which is. The length of a year varies according to leap years, and so does the length of February.

Time units always start as usual: a year starts on January 1st, a month starts on its 1st day, a day starts at 0 hours 0 minutes 0 seconds, and so on. A period ends after its last second. Hence you must report the maximum number of non-overlapping periods that fit exactly on these unit boundaries between the two time points.

The input consists of blocks of lines. Each block has three lines. The first line of a block contains a time point $D_1$ and the second line a time point $D_2$; $D_1$ always precedes $D_2$. All numbers on a line are separated by one space. You may assume that every given time point is valid. The third line contains a time period, with exactly one space between the number and the word. After each block there is one empty line.

Output one line for each block of the input. The line corresponding to a block contains a single integer telling how many of the specified periods are contained between the two given time points.