Yet Another String Problem

You are given a string $s$ of length $n$ only consisting of lowercase characters ($a$ - $z$). There are $q$ queries in one of the *two* formats: - $1$ $l$ $r$ $c$: Print count of character $c$ from index $l$ to $r$ of the string (inclusive). - $2$ $i$ $c$: Change the character at index $i$ of $s$ to $c$. ($s[i] = c$). The problem is divided into $2$ subtasks where **Subtask $\#1$ contains querie