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
/* Rajkin Hossain */

import java.io.*;
import java.util.*;
import static java.lang.Math.*;

public class D{
   
    FastInput k = new FastInput(System.in);
    //FastInput k = new FastInput("C:/Users/rajkin.h/Desktop/input.txt");
    FastOutput z = new FastOutput();
    
    int n, q;
    String s;
    
    NavigableSet<Integer> [] save;
    int [] map;
     
	void startProgram() {
    	while(k.hasNext()) {
    		s = k.next();
    		q = k.nextInt();
    		n = s.length();
    		
    		save = new TreeSet[26];
    		map = new int[n];
    		
    		for(int i = 0; i<n; i++) {
    			int charValue = s.charAt(i) - 97;
    			if(save[charValue] == null) {
    				save[charValue] = new TreeSet<Integer>();
    			}
    			
    			save[charValue].add(i);
    			map[i] = charValue;
    		}
    		
    		while(q-->0){
    			int type = k.nextInt();
    			if(type == 1) {
    				int pos = k.nextInt() - 1;
    				int ch = k.next().charAt(0) - 97;
    				
    				int prevChar = map[pos];
    				save[prevChar].remove(pos);
    				
        			if(save[ch] == null) {
        				save[ch] = new TreeSet<Integer>();
        			}
    				
    				save[ch].add(pos);
    				map[pos] = ch;
    			}
    			else {
    				int u = k.nextInt() - 1;
    				int v = k.nextInt() - 1;
    				
    				int count = 0;
    				
    				for(int i = 0; i<26; i++) {
    					if(save[i] == null || save[i].isEmpty()) continue;
    					
    					Integer ceil = save[i].ceiling(u);
    					Integer floor = save[i].floor(v);
    					
    					if(ceil == null || floor == null) {
    						continue;
    					}
    					
    					if(ceil <= v || floor >= u) {
    						count++;
    					}
    				}
    				
    				z.println(count);
    			}
    		}
    		
    		z.flush();
    	}
    	
    	System.exit(0);
    }
    
    public static void main(String [] args) throws IOException {
        new Thread(null, new Runnable(){
            public void run(){
            	try{ 
            		new D().startProgram();
            	}
            	catch(Exception e){
            		e.printStackTrace();
            	}
            }
        },"Main",1<<28).start();
    }
    

    /* MARK: FastInput and FastOutput */
 
    class FastInput {
        BufferedReader reader;
        StringTokenizer tokenizer;
 
        FastInput(InputStream stream){
            reader = new BufferedReader(new InputStreamReader(stream));
        }
       
        FastInput(String path){
            try {
                reader = new BufferedReader(new FileReader(path));
            } catch (FileNotFoundException e) {
                // TODO Auto-generated catch block
                e.printStackTrace();
            }
            tokenizer = null;
        }
 
        String next() {
            return nextToken();
        }
       
        String nextLine() {
            try {
                return reader.readLine();
            } catch (IOException e) {
                // TODO Auto-generated catch block
                e.printStackTrace();
            }
           
            return null;
        }
 
        boolean hasNext(){
            try {
                return reader.ready();
            } catch (IOException e) {
                // TODO Auto-generated catch block
                e.printStackTrace();
            }
            return false;
        }
 
        String nextToken() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                String line = null;
                try {
                    line = reader.readLine();
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
                if (line == null) {
                    return null;
                }
                tokenizer = new StringTokenizer(line);
            }
            return tokenizer.nextToken();
        }
 
        int nextInt() {
            return Integer.parseInt(nextToken());
        }
       
        long nextLong() {
            return Long.valueOf(nextToken());
        }
        
        double nextDouble() {
            return Double.valueOf(nextToken());
        }
    }
 
    class FastOutput extends PrintWriter {
		FastOutput() {
			super(new BufferedOutputStream(System.out)); 
		}
		
		public void debug(Object...obj) {
		    System.err.println(Arrays.deepToString(obj));
		}
    }
}