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.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Objects;
import java.util.Random;
import java.util.StringTokenizer;

public class Solution{
	
	
	
	public static void main(String[] args) {

		FastScanner fs = new FastScanner();
		PrintWriter out = new PrintWriter(System.out);
		
		int tt = 1;
		while(tt-->0) {
			
			char[] carr = fs.next().toCharArray();
			int n = carr.length;
			
			int[][] fen = new int[26][n+1];
			
			for(int i=0;i<n;i++) {
				update(fen[carr[i]-'a'], i+1, 1);
			}
			
			int q = fs.nextInt();
			while(q-->0) {
				int x = fs.nextInt();
				if(x==1) {
					int pos = fs.nextInt();
					char ch = fs.nextChar();
					char pre = carr[pos-1];
					update(fen[pre-'a'],pos,-1);
					update(fen[ch-'a'],pos,1);
					carr[pos-1] = ch;
				}
				else {
					int l = fs.nextInt(), r = fs.nextInt();
					int count =0;
					for(int j=0;j<26;j++) {
						if(query(fen[j],r)-query(fen[j],l-1)>0) count++;
					}
					out.println(count);
				}
			}
			
		}
		
		out.close();
		
	}
	
	static void update(int[] arr, int ind, int val) {
		int n = arr.length-1;
		while(ind<=n) {
			arr[ind] += val;
			ind += (ind)&(-ind);
		}
	}

	static int query(int[] arr, int ind) {
		int sum =0;
		while(ind > 0) {
			sum += arr[ind];
			ind -= (ind)&(-ind);
		}
		return sum;
	}
	
	
	
	static final Random random=new Random();
	
	static void ruffleSort(int[] a) {
		int n=a.length;//shuffle, then sort 
		for (int i=0; i<n; i++) {
			int oi=random.nextInt(n), temp=a[oi];
			a[oi]=a[i]; a[i]=temp;
		}
		Arrays.sort(a);
	}
	
	
	static class FastScanner{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer("");

		public String next(){
			while(!st.hasMoreElements()){
				try{
					st = new StringTokenizer(br.readLine());
				} catch(IOException e){
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}
		
		public String nextLine() throws IOException {
			return br.readLine();
		}
		
		public int nextInt(){
			return Integer.parseInt(next());
		}

		public int[] readArray(int n){
			int[] a = new int[n];
			for(int i=0;i<n;i++)
				a[i] = nextInt();
			return a;
		}
		
		public long nextLong() {
			return Long.parseLong(next());
		}
		
		public char nextChar() {
			return next().toCharArray()[0];
		}
	}
	
}
