#PCBTAM0000003. Lặp lại văn bản (Repeat Text)

Lặp lại văn bản (Repeat Text)

Repeat Text

Version: Phuoc Hung OJ Extended

Problem Statement

Given a string ss and a nonnegative integer nn, construct the string consisting of nn consecutive, unchanged copies of ss. Do not insert separators between copies.

If n=0n=0 or ss is empty, the resulting string is empty.

Input

The first line contains ss, which may be empty or have trailing spaces. The second line contains integer nn.

Output

Print the resulting string on one line. Print an empty line if the result is empty.

Subtasks

  • Subtask 1 (100 points): 0≤∣s∣≤400\le |s|\le 40; 0≤n≤200\le n\le 20; ∣s∣n≤800|s|n\le 800.

Examples

Example 1

Input

ab
3

Output

ababab

Explanation. Three copies of ab give ab + ab + ab = ababab.

Example 2

Input

Hi
0

Output


Explanation. With n=0n=0, no copies are printed; the output is empty.

Example 3

Input

x 
2

Output

x x 

Explanation. Each copy of x includes a trailing space, so two copies produce x x .