Cut and Dot

Difficulty: 800 2000 ms 128 MB

strings

If S is longer than K characters, keep the first K and append ...; otherwise print S unchanged.

Input: the first line has S; the second line has K.

Output: the possibly-truncated string.

Constraints:

• 1 ≤ |S| ≤ 10⁴
• 1 ≤ K ≤ 10⁴

Sample Tests

hello
3

hel...

hi
5

hi

Read the Editorial