An old mechanical cipher wheel encodes a lowercase passphrase s by replacing every letter with its 1-indexed position in the alphabet ('a' -> 1, 'b' -> 2, ..., 'z' -> 26) and concatenating those numbers, in order, into one (potentially very long) decimal integer. The wheel then "digests" this integer k times: each digest step replaces the current integer with the sum of its decimal digits.

Given s and k, report the integer that results after the wheel's initial encoding followed by exactly k digest steps.

Input format

• Line 1: the passphrase s.
• Line 2: the integer k.

Output format

A single integer: the value after encoding s and then applying the digest step k times.

Constraints

• 1 <= |s| <= 100
• 1 <= k <= 10
• s consists only of lowercase English letters ('a'-'z').

iiii
1

36

leetcode
2

6