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} ... 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 ≤ pos ≤ |s|, c is lowercase Latin letter): replace s_{pos} with c (set s_{pos} := c); 
  * 2~ l~ r (1 ≤ l ≤ r ≤ |s|): calculate the number of distinct characters in the substring s[l; r]. 

Input

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 ≤ q ≤ 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.

Output

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

Examples

Input


abacaba
5
2 1 4
1 4 b
1 5 b
2 4 6
2 1 7


Output


3
1
2


Input


dfcbbcfeeedbaea
15
1 6 e
1 4 b
2 6 14
1 7 b
1 12 c
2 6 8
2 1 6
1 7 c
1 2 f
1 10 a
2 7 9
1 10 a
1 14 b
1 1 f
2 1 11


Output


5
2
5
2
6
"""
Segment Tree

Verified:
    https://onlinejudge.u-aizu.ac.jp/problems/DSL_2_A
    https://judge.yosupo.jp/problem/staticrmq
    https://atcoder.jp/contests/abc125/tasks/abc125_c
    https://codeforces.com/problemset/problem/1234/D
"""
from operator import or_
from typing import Callable, List, Sequence, Union, Optional


class SegmentTree:
    __slots__ = ["_default_value", "_seg_func", "_modifying_func", "_size", "_tree"]

    def __init__(self, initial_values: Sequence, default_value: Union[int, str], seg_func: Callable,
                 modifying_func: Optional[Callable] = None) -> None:
        self._default_value = default_value
        self._seg_func = seg_func
        self._modifying_func = modifying_func
        self._size = 1 << (len(initial_values) - 1).bit_length()
        self._tree = self._build(initial_values)

    def _build(self, initial_values: Sequence) -> List:
        """Build a segment tree with initial values."""
        tree = [self._default_value] * (2 * self._size)
        if self._modifying_func:
            initial_values = list(map(self._modifying_func, initial_values))

        for idx, val in enumerate(initial_values):  # set a tree
            tree[idx + self._size - 1] = val

        for idx in range(self._size - 2, -1, -1):  # build
            tree[idx] = self._seg_func(tree[2 * idx + 1], tree[2 * idx + 2])

        return tree

    def update(self, index: int, value: int) -> None:
        """Update index to value."""
        index += self._size - 1
        if self._modifying_func:
            value = self._modifying_func(value)
        self._tree[index] = value
        while index:
            index = (index - 1) // 2
            self._tree[index] = self._seg_func(self._tree[2 * index + 1], self._tree[2 * index + 2])

    def query(self, left: int, right: int) -> Union[int, str]:
        """Respond to query in [left, right]."""
        left += self._size
        right += self._size
        result = self._default_value
        while left < right:
            if left & 1:
                result = self._seg_func(result, self._tree[left - 1])
                left += 1
            if right & 1:
                right -= 1
                result = self._seg_func(result, self._tree[right - 1])
            left >>= 1
            right >>= 1
        return result


def main():
    S, _, *queries = open(0).read().split()
    tree = SegmentTree(S, 0, or_, lambda s: 1 << (ord(s) - 97))
    ans = []
    for q_type, var1, var2 in zip(*[iter(queries)] * 3):
        if q_type == "1":
            idx, char = int(var1) - 1, var2
            tree.update(idx, char)
        else:
            left, right = int(var1) - 1, int(var2)  # [left, right)
            x = tree.query(left, right)
            cnt = bin(x).count("1")
            ans.append(cnt)
    print("\n".join(map(str, ans)))


if __name__ == "__main__":
    main()
