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
import sys
input = sys.stdin.readline

def segfunc(x, y):  # modify for each case
    return x | y


class SegmentTree:
    def __init__(
        self,
        init_val: "initial value: Array or str",
        ide_ele: "identity element corresponding init_val" = 0,
    ):
        self.size = 1 << (len(init_val) - 1).bit_length()
        self.ide_ele = ide_ele
        self.tree = self._build(init_val)

    def _build(self, init_val: "Array or str"):
        tree = [self.ide_ele] * (2 * self.size)

        for idx, val in enumerate(init_val):  # set
            # modify val if needed (e.g. str -> ord())
            val = 1 << (ord(val) - 97)
            tree[idx + self.size - 1] = val

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

    def update(self, idx: int, val):
        idx += self.size - 1
        # modify val if needed as same as in _build()
        val = 1 << (ord(val) - 97)
        self.tree[idx] = val
        while idx > 0:
            idx = (idx - 1) // 2
            self.tree[idx] = segfunc(self.tree[2 * idx + 1], self.tree[2 * idx + 2])

    def query(self, left: int, right: int):
        if left >= right:
            return self.ide_ele

        left += self.size
        right += self.size
        ret = self.ide_ele
        while left < right:
            if left & 1:
                ret = segfunc(ret, self.tree[left - 1])
                left += 1
            if right & 1:
                right -= 1
                ret = segfunc(ret, self.tree[right - 1])
            left >>= 1
            right >>= 1
        return ret


def main():
    S = input().rstrip()
    Q = int(input())
    queries = tuple(input().split() for _ in range(Q))
    seg = SegmentTree(S)
    ans = []
    for q_type, var1, var2 in queries:
        if q_type == "1":
            idx, char = int(var1) - 1, var2
            seg.update(idx, char)
        else:
            left, right = int(var1) - 1, int(var2)  # [left, right)
            x = seg.query(left, right)
            cnt = bin(x).count("1")
            ans.append(cnt)
    print("\n".join(map(str, ans)))


if __name__ == "__main__":
    main()