The ABC number of a string T is the number of triples of integers (i, j, k) that satisfy all of the following conditions:

* 1 ≤ i < j < k ≤ |T| (|T| is the length of T.)
* T_i = `A` (T_i is the i-th character of T from the beginning.)
* T_j = `B`
* T_k = `C`



For example, when T = `ABCBC`, there are three triples of integers (i, j, k) that satisfy the conditions: (1, 2, 3), (1, 2, 5), (1, 4, 5). Thus, the ABC number of T is 3.

You are given a string S. Each character of S is `A`, `B`, `C` or `?`.

Let Q be the number of occurrences of `?` in S. We can make 3^Q strings by replacing each occurrence of `?` in S with `A`, `B` or `C`. Find the sum of the ABC numbers of all these strings.

This sum can be extremely large, so print the sum modulo 10^9 + 7.

Constraints

* 3 ≤ |S| ≤ 10^5
* Each character of S is `A`, `B`, `C` or `?`.

Input

Input is given from Standard Input in the following format:


S


Output

Print the sum of the ABC numbers of all the 3^Q strings, modulo 10^9 + 7.

Examples

Input

A??C


Output

8


Input

ABCBC


Output

3


Input

????C?????B??????A???????


Output

979596887
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

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

    static class DWeLoveABC {
        public void solve(int testNumber, Scanner in, PrintWriter out) {

            String s = in.next();
            ModInt[] mi = new ModInt[4];
            Arrays.fill(mi, new ModInt(0));

            mi[0] = new ModInt(1);

            if (s.charAt(0) == 'A') {
                mi[1] = new ModInt(1);
            }

            if (s.charAt(0) == '?') {
                mi[0] = new ModInt(3);
                mi[1] = new ModInt(1);
            }

            for (int i = 1; i < s.length(); i++) {
                char c = s.charAt(i);

                if (c == '?') {
                    mi[3] = mi[3].mul(3).add(mi[2]);
                    mi[2] = mi[2].mul(3).add(mi[1]);
                    mi[1] = mi[1].mul(3).add(mi[0]);
                    mi[0] = mi[0].mul(3);
                }
                if (c == 'C') {
                    mi[3] = mi[3].add(mi[2]);
                }
                if (c == 'B') {
                    mi[2] = mi[2].add(mi[1]);
                }
                if (c == 'A') {
                    mi[1] = mi[1].add(mi[0]);
                }
            }


            out.println(mi[3].getVal());

        }

    }

    static class ModInt {
        long val;
        int MOD = (int) 1e9 + 7;

        public ModInt(long i) {
            this.val = (i + MOD) % MOD;
        }

        public ModInt mul(long l) {
            return new ModInt(this.val * l);
        }

        public ModInt add(ModInt m) {
            return new ModInt(this.val + m.getVal());
        }

        public long getVal() {
            return val;
        }

        public String toString() {
            return "ModInt{" +
                    "val=" + val +
                    ", MOD=" + MOD +
                    '}';
        }

    }
}

