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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.FileInputStream;
import java.util.ArrayList;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        OutputWriter out = new OutputWriter(outputStream);
        DDistinctCharactersQueries solver = new DDistinctCharactersQueries();
        solver.solve(1, in, out);
        out.close();
    }

    static class DDistinctCharactersQueries {
        private int n;
        private char[] arr;

        public void solve(int testNumber, InputReader in, OutputWriter out) {
            String str = in.nextLine();
            n = str.length();
            arr = new char[n];
            for (int i = 0; i < n; i++) arr[i] = str.charAt(i);
            SegmentTree st = new SegmentTree(n);
            int q = in.nextInt();
            for (int i = 0; i < q; i++) {
                int t = in.nextInt();
                if (t == 1) {
                    int ind = in.nextInt() - 1;
                    int new_ch = in.next().charAt(0) - 'a';
                    int old_ch = arr[ind] - 'a';
                    st.update(0, 0, n - 1, ind, 0, old_ch);
                    st.update(0, 0, n - 1, ind, 1, new_ch);
                } else {
                    int qs = in.nextInt() - 1, qe = in.nextInt() - 1;
                    int ans = 0;
                    for (int ch = 0; ch < 26; ch++) if (st.query(0, 0, n - 1, qs, qe, ch) > 0) ans++;
                    out.println(ans);
                }
            }
            out.flush();
        }

        class SegmentTree {
            private int[][] st;

            private SegmentTree(int n) {
                int x = (int) Math.ceil(Util.log2(n));
                st = new int[(1 << (x + 1)) - 1][26];
                buildTree(0, 0, n - 1);
            }

            private void buildTree(int sti, int sts, int ste) {
                if (sts == ste) {
                    char ch = arr[sts];
                    st[sti][ch - 'a'] = 1;
                    return;
                }
                int mid = Util.getMid(sts, ste);
                buildTree((sti << 1) | 1, sts, mid);
                buildTree((sti + 1) << 1, mid + 1, ste);
                for (int ch = 0; ch < 26; ch++) st[sti][ch] = st[(sti << 1) | 1][ch] + st[(sti + 1) << 1][ch];
            }

            private int query(int sti, int sts, int ste, int qs, int qe, int ch) {
                if (qe < sts || ste < qs) return 0;
                if (qs <= sts && ste <= qe) return st[sti][ch];
                int mid = Util.getMid(sts, ste);
                return query((sti << 1) | 1, sts, mid, qs, qe, ch) + query((sti + 1) << 1, mid + 1, ste, qs, qe, ch);
            }

            private void update(int sti, int sts, int ste, int ind, int val, int ch) {
                if (sts == ste) {
                    arr[sts] = (char) (ch + 97);
                    st[sti][ch] = val;
                    return;
                }
                int mid = Util.getMid(sts, ste);
                if (ind <= mid) update((sti << 1) | 1, sts, mid, ind, val, ch);
                else update((sti + 1) << 1, mid + 1, ste, ind, val, ch);
                st[sti][ch] = st[(sti << 1) | 1][ch] + st[(sti + 1) << 1][ch];
            }

        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[8192];
        private int curChar;
        private int numChars;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public InputReader(FileInputStream file) {
            this.stream = file;
        }

        public int read() {
            if (numChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0) {
                    return -1;
                }
            }
            return buf[curChar++];
        }

        public int nextInt() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res = (res << 3) + (res << 1) + c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public String next() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isSpaceChar(c));
            return res.toString();
        }

        public String nextLine() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isEndOfLine(c));
            return res.toString();
        }

        private boolean isSpaceChar(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        private boolean isEndOfLine(int c) {
            return c == '\n' || c == '\r' || c == -1;
        }

    }

    static class OutputWriter {
        private final PrintWriter writer;
        private ArrayList<String> res = new ArrayList<>();
        private StringBuilder sb = new StringBuilder("");

        public OutputWriter(OutputStream outputStream) {
            writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        }

        public OutputWriter(Writer writer) {
            this.writer = new PrintWriter(writer);
        }

        public void println(Object... objects) {
            for (int i = 0; i < objects.length; i++) {
                sb.append(objects[i]);
            }
            res.add(sb.toString());
            sb = new StringBuilder("");
        }

        public void close() {
            writer.close();
        }

        public void flush() {
            for (String str : res) writer.printf("%s\n", str);
            res.clear();
            sb = new StringBuilder("");
        }

    }

    static class Util {
        public static int getMid(int a, int b) {
            return (a + b) >> 1;
        }

        public static double log2(int num) {
            return Math.log(num) / Math.log(2);
        }

    }
}

