#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
template<int MOD> struct ModInt {
    static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
    ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    int get() const { return (int)x; }
    ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
    ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
    ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
    ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
    ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
    ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
    ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;
        while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
        return ModInt(u); }
    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
    ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
typedef ModInt<1000000007> mint;

const int MAX_N = 1e5;

int main(){
    string S; cin >> S;
    mint dp[MAX_N+1][4]; // dp[i][j] := i番目の文字までで、j(A,AB,ABC)が作れる数
    int N = S.size();


    rep(i, 0, N + 1){
        if(i != 0){
            if(S[i-1] == '?'){
                rep(j, 0, 4){
                    dp[i][j] = (mint)3 * dp[i-1][j];
                }
            }else{
                rep(j, 0, 4){
                    dp[i][j] = dp[i-1][j];
                }
            }
            if(S[i-1] == 'A') dp[i][1] += dp[i-1][0];
            else if(S[i-1] == 'B') dp[i][2] += dp[i-1][1];
            else if(S[i-1] == 'C') dp[i][3] += dp[i-1][2];
            else if(S[i-1] == '?'){
                dp[i][1] += dp[i-1][0];
                dp[i][2] += dp[i-1][1];
                dp[i][3] += dp[i-1][2];
            }
        }else{
            dp[i][0] = 1;
        }
        //rep(j, 0, 4) cout << dp[i][j] << " ";
        //cout << endl;
    }
    cout << dp[N][3] << endl;
}

Measured memory_bytes: 2048