String Decreasing Substring Concatenation

Background

Congcong is currently learning about string processing. He encountered an interesting problem and needs your help to solve it.

Problem Description

Given a string $s$ and an integer $n$, return a new string. This new string is formed by concatenating the first $n$ characters of $s$, followed by the first $n-1$ characters of $s$, then the first $n-2$ characters of $s$, and so on, until the first $1$ character of $s$. You may assume that $n$ is between $0$ and the length of the string $s$, inclusive (i.e., $0 \le n \le ext{length}(s)$).

Input Format

Input is given from standard input in the following format.

A line containing a string $s$. A line containing an integer $n$.

Output Format

Output is printed to standard output in the following format.

A string, representing the concatenated result.

Sample

Chocolate
4

ChocChoChC

Chocolate
3

ChoChC

Ice Cream
2

IcI

Sample Explanation

Sample 1: The input string is "Chocolate\