CF1234D.Distinct Characters Queries

You are given a string $s$ consisting of lowercase Latin letters and $q$ queries for this string.

Recall that the substring $s[l; r]$ of the string $s$ is the string $s_l s_{l + 1} \dots s_r$. For example, the substrings of "codeforces" are "code", "force", "f", "for", but not "coder" and "top".

There are two types of queries:

• $1~ pos~ c$ ($1 \le pos \le |s|$, $c$ is lowercase Latin letter): replace $s_{pos}$ with $c$ (set $s_{pos} := c$);
• $2~ l~ r$ ($1 \le l \le r \le |s|$): calculate the number of distinct characters in the substring $s[l; r]$.

给你一个由小写拉丁字母组成的字符串 $s$，以及 $q$ 个针对该字符串的查询。

回忆一下，字符串 $s$ 的子串 $s[l; r]$ 定义为字符串 $s_l s_{l + 1} \dots s_r$。例如，"codeforces" 的子串包括 "code"、"force"、"f"、"for"，但不包括 "coder" 和 "top"。

查询分为两种类型：

• $1~ pos~ c$（其中 $1 \le pos \le |s|$，$c$ 为一个小写拉丁字母）：将 $s_{pos}$ 替换为 $c$（即令 $s_{pos} := c$）；
• $2~ l~ r$（其中 $1 \le l \le r \le |s|$）：计算子串 $s[l; r]$ 中不同字符的个数。

The first line of the input contains one string $s$ consisting of no more than $10^5$ lowercase Latin letters.

The second line of the input contains one integer $q$ ($1 \le q \le 10^5$) — the number of queries.

The next $q$ lines contain queries, one per line. Each query is given in the format described in the problem statement. It is guaranteed that there is at least one query of the second type.

输入的第一行包含一个字符串 $s$，由不超过 $10^5$ 个小写拉丁字母组成。

输入的第二行包含一个整数 $q$（$1 \le q \le 10^5$）—— 查询的数量。

接下来的 $q$ 行每行包含一个查询。每个查询的格式如题目描述中所述。保证至少存在一个第二类查询。

For each query of the second type print the answer for it — the number of distinct characters in the required substring in this query.

对于每个第二类查询，请输出该查询的答案——即该查询所要求的子串中不同字符的数量。