Admissions Record

Source: Phước Hưng OJ

Version: Phuoc Hung OJ Extended

Problem Statement

An admissions record contains a candidate code, a full name line, three date fields, a bonus score, a declared preference count $N$, and exactly $N$ preference codes. Print the normalized record for checking. Keep codes and the full name as text while converting numeric fields to their correct types.

Input

Line 1 is candidate code $C$. Line 2 is full name $S$. Line 3 contains integers $D,M,Y$ in day, month, year order. Line 4 is real bonus score $B$. Line 5 is integer $N$. Line 6 contains exactly $N$ preference codes.

Output

Print exactly six lines: candidate code; full name; the three space-separated date fields; the bonus score as a float; $N$ and the actual code count; finally, all preference codes separated by one space.

Subtasks

• Subtask 1 — 100 points: $1\le N\le20$; $1\le D\le31$, $1\le M\le12$, $1\le Y\le9999$ (calendar validity is not tested); $0\le B\le10$ with at most three fractional digits. Codes are 1–20 non-whitespace characters; the full name contains 1–100 characters. Length and score-format limits are added for this training version.

Examples

Input

TS007
Nguyen Van An
1 9 2010
1.5
3
NV01 NV02 NV03

Output

TS007
Nguyen Van An
1 9 2010
1.5
3 3
NV01 NV02 NV03

Explanation

Read TS007 and the full name Nguyen Van An. The date becomes $D=1$, $M=9$, $Y=2010$, the bonus is float $1.5$, and $N=3$. The final line contains three code tokens, so len(choices)=3. The six output lines are the code, name, 1 9 2010, 1.5, 3 3, and NV01 NV02 NV03.