A wizard has a magic word of length n consisting of lowercase English letters.

The wizard performs q spells. Each spell contains three integers l, r, and x.

This spell rotates every character from position l to position r forward by x steps in the alphabet.

After z, the alphabet starts again from a.

Your task is to print the final magic word after all spells are applied.

The first line contains two integers KaTeX can only parse string typed expression and KaTeX can only parse string typed expression — the length of the magic word and the number of spells.

The second line contains a string KaTeX can only parse string typed expression of length KaTeX can only parse string typed expression.

Each of the next KaTeX can only parse string typed expression lines contains three integers KaTeX can only parse string typed expression, KaTeX can only parse string typed expression, and KaTeX can only parse string typed expression.

Print the final magic word after applying all spells.