#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <queue>

using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;

const ll MOD = (ll)1e9 + 7;
const ll MOD2 = 998244353;
const ll HIGHINF = (ll)1e18;
const ll LOWINF = (ll)1e15;
const long double PI = 3.1415926535897932384626433;

template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max<T>(a,b);}
template <class T> void chmin(T& a, const T b){a=min<T>(a,b);}
void YN(bool flg) {cout << ((flg) ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << ((flg) ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << ((flg) ? "yes" : "no") << endl;}

int main() {
    string S; cin >> S;
    int N = S.size();
    V<ll> A(N,0),C(N,0),L(N,0),R(N,0),pow3(N+1,1);
    for(int i = 0; i < N; ++i) A[i] = (S[i]=='A');
    for(int i = 0; i < N; ++i) C[i] = (S[i]=='C');
    for(int i = 0; i < N; ++i) L[i] = (S[i]=='?');
    for(int i = 0; i < N; ++i) R[i] = (S[i]=='?');
    for(int i = 1; i < N; ++i) A[i] += A[i-1];
    for(int i = N-2; 0 <= i; --i) C[i] += C[i+1];
    for(int i = 1; i < N; ++i) L[i] += L[i-1];
    for(int i = N-2; 0 <= i; --i) R[i] += R[i+1];
    for(int i = 1; i < N; ++i) pow3[i] = (pow3[i-1]*3LL) % MOD;

    ll ans = 0;
    for(int i = 1; i + 1 < N; ++i){
        if(S[i]=='B' || S[i]=='?'){
            (ans += ((A[i-1]*C[i+1])*(pow3[L[i-1]+R[i+1]])) % MOD ) %= MOD;
            (ans += ((A[i-1]*R[i+1])*(pow3[ max(0LL,L[i-1]+R[i+1]-1)])) % MOD ) %= MOD;
            (ans += ((L[i-1]*C[i+1])*(pow3[ max(0LL,L[i-1]+R[i+1]-1)])) % MOD ) %= MOD;
            (ans += ((L[i-1]*R[i+1])*(pow3[ max(0LL,L[i-1]+R[i+1]-2)])) % MOD ) %= MOD;
        }
    }
    cout << ans << endl;
    return 0;
}



Measured memory_bytes: 4352