Handson $2$i String Transformations Queries

You are given a string $S$ of length $N$ and a cost array C of size AxB where A and $8$ are both gqual to $26.$ The value $C[i][j]$ denotes the cost of transforming the $i^{th}$ letter of the alphabet into the $j^{th}$ letter of the alphabet for all TQLRPiS$[K]x^{th}NSC0j.$

You are also given $a20$ array $T$ which consists $ofQ$ queries and each query $is$ either $of$ the following two types:

Type $1-1LR$: Let $Pbe$ the minimum cost $to$ make all letters $in$ the substring from $L[i]toR[i]$ equal. The answer $to$ this query $is$ the product $ofP$ and the value $i.$

Type $2-2KX$: Replace the $S[K]$ with the $x^{th}$ character $in$ the alphabet.

Find the sum $of$ answers $of$ queries $of$ Type $1.$

Input Format

The first line contains $an$ integer, $N,$ denoting the given integer.

The next line contains a string, $S,$ denoting the given string.

The next line contains $an$ integer, A denoting the number $of$ rows $inC\mathrm{.}0$ and $0j.$

You are also given $a20$ array $T$ which consists $ofQ$ queries and each query $is$ either $of$ the following two types:

Type $1-1LR$: Let $Pbe$ the minimum cost $to$ make all letters $in$ the substring from $L[i]toR[i]$ equal. The answer $to$ this query $is$ the product $ofP$ and the value $i.$

Type $2-2KX$: Replace the $S[K]$ with the $x^{th}$ character $in$ the alphabet.

Find the sum $of$ answers $of$ queries $of$ Type $1.$

Input Format

The first line contains $an$ integer, $N,$ denoting the given integer.

The next line contains a string, $S,$ denoting the given string.

The next line contains $an$ integer, A denoting the number $of$ rows $inC.$