Warehouse Record

Source: Phước Hưng OJ

Version: Phuoc Hung OJ Extended

Problem Statement

A warehouse record contains a warehouse code and declared item count $N$. The next line contains exactly $N$ item codes. Print the warehouse code, $N$, the actual code count, and the complete sequence. Codes may start with 0 and may repeat; each code is text.

Input

Line 1 contains warehouse code $C$ and integer $N$. Line 2 contains exactly $N$ item codes $S_1,S_2,\ldots,S_N$ separated by whitespace.

Output

Line 1 prints the warehouse code, $N$, and the actual code count, separated by spaces. Line 2 prints all item codes in their original order, separated by one space.

Subtasks

• Subtask 1 — 100 points: $1\le N\le50$. The warehouse and item codes are each 1–20 non-whitespace characters long. All codes are treated as strings.

Examples

Input

K01 3
SP01 SP02 SP03

Output

K01 3 3
SP01 SP02 SP03

Explanation

The first line yields code K01 and text 3, converted to $N=3$. The second line forms three codes: SP01, SP02, SP03, so len(item_codes)=3. The first output line is K01 3 3; the next line prints the three codes.