A10538 | Cron

The first line of the input contains six integers $s$ , $m$ , $h$ , $day$ , $date$ and $month$ ( $0<=s,m<=59$ , $0<=h<=23$ , $1<=day<=7$ , $1<=date<=31$ , $1<=month<=12$ ). Each of the number can also be equal to $-1$ . It's guaranteed, that there are infinitely many moments of time when this task should be executed.

Next line contains the only integer $n$ ( $1<=n<=1000$ ) — the number of moments of time you have to solve the problem for. Each of the next $n$ lines contains a single integer $t_{i}$ ( $0<=t_{i}<=10^{12}$ ).

Print $n$ lines, the $i$ -th of them should contain the first moment of time strictly greater than $t_{i}$ , when the task should be executed.

The moment of time $1467372658$ after the midnight of January 1st, 1970 is 11:30:58 July 1st, 2016.