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.util.*;
import java.io.*;
import java.math.*;
public class Main{
	static int mod = (int)1e9+7;
	public static PrintWriter out = new PrintWriter (new BufferedOutputStream(System.out));
	public static void main(String sp[])throws IOException{
		FastReader sc = new FastReader();
		char fg[] = sc.next().toCharArray();
		int n = sc.nextInt();
		TreeMap<Integer,Integer>[] arr = new TreeMap[26];
		for(int i=0;i<26;i++)
			arr[i] = new TreeMap<Integer,Integer>(); 
		
		for(int i=0;i<fg.length;i++){
			arr[fg[i]-'a'].put(i,0);
		}
		StringBuilder sb = new StringBuilder();
		for(int i=0;i<n;i++){
			int flag= sc.nextInt();
			int pos = 0,l=0,r=0;
			if(flag==1){
				pos = sc.nextInt()-1;
				char ch = sc.next().charAt(0);
				int g = fg[pos]-'a';
				if(arr[g].containsKey(pos))
				arr[g].remove(pos);
				arr[ch-'a'].put(pos,0);
				fg[pos] = ch;
			}else{
				l = sc.nextInt()-1;
				r = sc.nextInt()-1;
				int count = 0;
				
				for(int j=0;j<26;j++){
					if(arr[j].ceilingKey(l) != null){
	                     int key = arr[j].ceilingKey(l);
	                     
	                     if(key<=r) 	
	                    	 count++;
					}else if( arr[j].containsKey(l))
						count++;
				}
				sb.append(count+"\n");
			}
			
		}
		System.out.println(sb.toString());
	}
	
	
	/* public static class pair{
		int x;
		int y;
	}
	
	static boolean prime[] = new boolean[(int)1e4+1];
	public static void prime(){
		for(int i=2;i<=Math.sqrt((int)1e4);i++){
			if(prime[i]==false){
				for(int j=i*i;j<=(int)1e4;j+=i){
					prime[j]=true;
				}
			}
		}
	}
	
	public static class comp implements Comparator<pair>{
		public int compare(pair o1, pair o2){
			return o2.x-o1.x;	
		}
	}
	
	static long fenwick[][][];
	
	public static void build(int x, int y, int z, long m, int n){
		for(int i=x;i<=n;i++){
			for(int j=y;j<=n;j++){
				for(int k=z;k<=n;k++){
					update(m, i, j, k, n);
				}
			}
		}
	}
	
	public static void update(long val, int x, int y, int z , int n){
		while(x<=n && y<=n && z<=n){
			fenwick[x][y][z] += val;
			x = (x+(x&(-x)));
			y = (y+(y&(-y)));
			z = (z+(z&(-z)));
		}
	}
	
	public static long query(int x1, int y1, int z1){
		long ans=0;
		while(x1>0 && y1>0 && z1>0){
			ans+=fenwick[x1][y1][z1];
			x1 = (x1-(x1&(-x1)));
			y1 = (y1-(y1&(-y1)));
			z1 = (z1-(z1&(-z1)));
		}
		return ans;
	}
	
	public static long sum(long a, long d, long n){
		
		long total = ((n)*((2*a)+(n-1)*d))/2;
		return total;
	}
	
	public static class trie{
		char ch;
		HashMap<Character,trie> hm = new HashMap<>();
		int count;
		boolean isterminal;
	}
	
	
	public static int partition(int [] arr, int s, int e){
		
		int index=s;
		int pivot = arr[e];
		for(int i=s;i<=e-1;i++){
			if(arr[i]<=pivot){
				arr = swap(arr, index, i);
				index++;
			}
		}
		swap(arr,index,e);
		print(arr);
		return index;
	}
	
	public static int[] swap(int[] arr, int low, int high){
		int temp = arr[low];
		arr[low]=arr[high];
		arr[high]=temp;
		return arr;
	}
	
	
	public static long gcd(long a, long b){
		if(a==0)
			return b;
		
		return gcd(b%a,a);
	}
	
	public static void print(int[] arr){
		for(int i=0;i<arr.length;i++)
			System.out.print(arr[i]+" ");
		System.out.println();
	} */
	
 
	public static class FastReader {
		BufferedReader br;
		StringTokenizer st;
	
 
		public FastReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}
 
		String next() {
			while (st == null || !st.hasMoreTokens()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (Exception r) {
					r.printStackTrace();
				}
			}
			return st.nextToken();
		}
 
		int nextInt() {
			return Integer.parseInt(next());//converts string to integer
		}
 
		double nextDouble() {
			return Double.parseDouble(next());
		}
 
		long nextLong() {
			return Long.parseLong(next());
		}
 
		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (Exception r) {
				r.printStackTrace();
			}
			return str;
		}
	}
	
}

