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
#include <bits/stdc++.h>
using namespace std;
#define ll long long

ll m = 1e9+7;

int main() {
	string s; cin>>s;
	vector<ll> ABC(s.size()+1), AB(s.size()+1), A(s.size()+1);
	ll qmarks=1;

	for (ll i=0; i<s.size(); i++) {
		A[i+1] = A[i];
		AB[i+1] = AB[i];
		ABC[i+1] = ABC[i];
		if (s[i]=='A')
			A[i+1] = (A[i]%m + qmarks%m)%m;
		if (s[i]=='B')
			AB[i+1] = (AB[i]%m + A[i]%m)%m;
		if (s[i]=='C')
			ABC[i+1] = (ABC[i]%m + AB[i]%m)%m;
		if (s[i]=='?') {
			A[i+1] = ((A[i]*3)%m + qmarks%m)%m;
			AB[i+1] = ((AB[i]*3)%m + A[i]%m)%m; 
			ABC[i+1] = ((ABC[i]*3)%m + AB[i]%m)%m;
			qmarks = (qmarks*3)%m;
		}
	}
	
	cout << ABC.back() << endl;

	return 0;
}
