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.util.Scanner;
import java.util.stream.IntStream;

/**
 * 解説どおりに作成したソースコード
 */
public class Main {

	/** 文字列ABC */
	private static final char[] ABC = new char[] { 'A', 'B', 'C' };
	/** 文字? */
	private static final char ALL = '?';
	/** 1_000_000_007 */
	private static final long MOD = 1_000_000_007L;

	public static void main(String[] args) {
		try (Scanner scanner = new Scanner(System.in)) {
			char[] s = scanner.next().toCharArray();
			int n = s.length;
			long[][] dp = new long[n + 1][4];
			dp[n][3] = 1L;
			dp[n][0] = dp[n][1] = dp[n][2] = 0L;
			IntStream.rangeClosed(1, n).map(i -> n - i).forEach(i -> {
				dp[i][3] = ((ALL == s[i]) ? 3 : 1) * dp[i + 1][3] % MOD;
				IntStream.range(0, 3).forEach(j -> dp[i][j] = (((ALL == s[i]) ? 3 : 1) * dp[i + 1][j] % MOD
						+ (((ALL == s[i]) || (ABC[j] == s[i])) ? 1 : 0) * dp[i + 1][j + 1] % MOD) % MOD);
			});
			System.out.println(dp[0][0]);
		}
	}
}
