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.IOException;

import java.io.BufferedReader;
import java.io.InputStreamReader;

import java.io.PrintWriter;

import java.util.Arrays;

@SuppressWarnings("unchecked")
public class Main {
    static final int INF = 1000000007;
    static final char Q = '?';
    static final String ABC = "ABC";

    // aとbを足した値をmodする(a + b mod p)
    static int modadd(int a, int b) {
        return (a + b) % INF;
    }

    // aとbを掛けた値をmodする(a * b mod p)
    static int modmulti(int a, int b) {
        int res = 0;
        int mod = a % INF;
        while (b > 0) {
            if ((b & 1) == 1) {
                res += mod;
                if (res > INF) res -= INF;
            }
            mod <<= 1;
            if (mod > INF) mod -= INF;
            b >>= 1;
        }
        return res;
    }

    public static void main(String[] args) throws IOException {
        final String S;

        try (
            BufferedReader reader = new BufferedReader(
                new InputStreamReader(System.in))) {
            S = reader.readLine();
        }

        PrintWriter out = new PrintWriter(System.out);

        int len = S.length();

        int[][] dp = new int[len + 1][ABC.length() + 1];

        for (int i = 0; i < len + 1; i++) Arrays.fill(dp[i], 0);

        dp[len][ABC.length()] = 1;

        for (int i = len - 1; 0 <= i; i--) {
            int n = 1;
            boolean q = false;

            if (S.charAt(i) == Q) {
                n = ABC.length();
                q =  true;
            }

            for (int j = 0; j <= ABC.length(); j++) {
                // ○ 3
                if (j == ABC.length())
                    dp[i][j] =
                        modadd(dp[i][j], modmulti(dp[i + 1][j], n));
                // ○ 3 以外
                else {
                    int m = 1;

                    if (!q && ABC.charAt(j) != S.charAt(i)) m = 0;

                    dp[i][j] =
                        modadd(dp[i][j], modmulti(dp[i + 1][j], n));

                    dp[i][j] =
                        modadd(dp[i][j], modmulti(dp[i + 1][j + 1], m));
                }
            }
        }

        out.println(dp[0][0]);

        out.flush();
    }
}
