//file_name:ABC104_B.cpp
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts()
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const v(T)&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return 0;}
#define yn {puts("YES");}else{puts("NO");}
const int MX = 200005;

    // 整数スキャン（複数）
    /*
    int x;
    scanf("%d",&x);
    int y;
    scanf("%d",&y);
    int z;
    scanf("%d",&y);

    // n個の整数のスキャン
    /*
    ll a[n] = {};
    rep(i,n){
        scanf("%lld",&a[i]);
    }
    */

    // 文字列スキャン
    /*
    string s;
    cin >> s;
    */


int main() {
    string s;
    cin >> s;

    int si = s.size();

    ll sum[4] = {};
    ll qsum[si+1] = {};
    ll asum[si+1] = {};
    ll bsum[si+1] = {};
    ll csum[si+1] = {};
    rep(i,si){
        if(s[i]=='?'){
            sum[0]++;
        }
        if(s[i]=='A'){
            sum[1]++;
        }
        if(s[i]=='B'){
            sum[2]++;
        }
        if(s[i]=='C'){
            sum[3]++;
        }
        qsum[i+1] = sum[0];
        asum[i+1] = sum[1];
        bsum[i+1] = sum[2];
        csum[i+1] = sum[3];
    }
    ll bc[si+1] = {};
    ll dp[si+1] = {};
    
    ll qpow[100100];
    qpow[0] = 1;
    srep(i,1,100050){
        qpow[i] = qpow[i-1]*3;
        qpow[i] = qpow[i]%1000000007;
    }


    srep(i,2,si){
        if(s[i-1]=='A'||s[i-1]=='C'){
            bc[i] = 0;
        }else{
            if(sum[0]-qsum[i]>0){
                bc[i] = (sum[3]-csum[i])*qpow[sum[0]-qsum[i]] + (sum[0]-qsum[i])*qpow[sum[0]-qsum[i]-1];
                bc[i] = bc[i]%1000000007;
            }else{
                bc[i] = sum[3] - csum[i];
                bc[i] = bc[i]%1000000007;
            } 
        }
    }


    ll bcsum[si+1] = {};
    for(int i=si-1;i>0;i--){
        if(s[i-1]=='?'){
            bcsum[i] = bcsum[i+1]*3 + bc[i];
            bcsum[i] = bcsum[i]%1000000007;
        }else{
            bcsum[i] = bcsum[i+1] + bc[i];
            bcsum[i] = bcsum[i]%1000000007;
        }   
    }


    srep(i,1,si-1){
        if(s[i-1]=='B'||s[i-1]=='C'){
            dp[i] = 0;
        }else{
            dp[i] = bcsum[i+1]*qpow[qsum[i-1]];
            dp[i] = dp[i]%1000000007;
        }
    }

    ll ans = 0;

    srep(i,1,si-1){
        ans += dp[i];
        ans = ans%1000000007;
    }

    cout << ans << endl;
    return 0;
}



Measured memory_bytes: 6784