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 java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.util.TreeSet;

public class Main
{
    public static void main(String [] args) throws Exception
    {

        Scanner sc = new Scanner() ;
        PrintWriter out = new PrintWriter(System.out) ;

        char [] s = sc.next().toCharArray() ;
        int n = s.length ;
        int N = 1 ;
        SegmentTree seg [] = new SegmentTree[26] ;

        for(int i = 0 ; i < 26 ; i ++)
        {

            seg[i] = new SegmentTree(n) ;
            for(int j = 1 ; j <= n ; j++)
                if(s[j - 1] - 'a' == i)
                    seg[i].update_point(j , true);
        }
        int q = sc.nextInt() ;

        while (q-->0)
        {
            int t = sc.nextInt() ;
            if(t == 1)
            {
                int idx = sc.nextInt() ;
                seg[s[idx - 1] - 'a'].update_point(idx , false);
                int cur = sc.next().charAt(0) - 'a' ;
                seg[cur].update_point(idx , true);
                s[idx - 1] = (char)(cur + 'a') ;
            }
            else
            {
                int l = sc.nextInt() , r = sc.nextInt() ;
                int cnt = 0 ;
                for(int i = 0 ;i  < 26 ; i++)
                    if(seg[i].query(l , r))
                        cnt ++ ;
                out.println(cnt) ;
            }
        }

        out.flush();

    }
    static class SegmentTree {		// 1-based DS, OOP

        int N; 			//the number of elements in the array as a power of 2 (i.e. after padding)
        boolean [] sTree ;

        SegmentTree(int n)
        {
            N = 1 << (32 - Integer.numberOfLeadingZeros(n - 1)) ;
            sTree = new boolean [N << 1] ;

        }

        void update_point(int index, boolean val)			// O(log n)
        {
            index += N - 1;
            sTree[index] = val ;
            while(index>1)
            {
                index >>= 1;
                sTree[index] = sTree[index<<1] | sTree[index<<1|1];
            }
        }

        boolean query(int l , int r)
        {
            return query(1 , 1 , N , l , r) ;
        }

        boolean query(int node, int b, int e, int i, int j)
        {
            if(i>e || j <b)
                return false;
            if(b>= i && e <= j)
                return sTree[node];
            int mid = b + e >> 1;

            boolean q1 = query(node<<1,b,mid,i,j);
            boolean q2 = query(node<<1|1,mid+1,e,i,j);
            return q1 | q2;
        }
    }
    static class Scanner
    {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in)) ;
        StringTokenizer st ;

        String next() throws Exception
        {
            while (st == null || !st.hasMoreTokens())
                st = new StringTokenizer(br.readLine()) ;
            return st.nextToken() ;
        }
        int nextInt() throws Exception
        {
            return Integer.parseInt(next()) ;
        }
     }


}
