#include "bits/stdc++.h"
#define Rep(i,n) for(int i=0;i<n;i++)
#define For(i,n1,n2) for(int i=n1;i<n2;i++)
#define REP(i,n) for(ll i=0;i<n;i++)
#define FOR(i,n1,n2) for(ll i=n1;i<n2;i++)
#define put(a) cout<<a<<endl;
#define all(a)  (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define TDARRAY(int,a,n,m) vector<vector<int>> a(n,vector<int>(m,0));
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) {if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a, T b) {if(a>b){a=b;return 1;}return 0;}

class Modulo{
public:
    ll val;
    static const ll mod = 1e9+7;
    vector<ll> factable = {1};
    vector<ll> invtable = {1};
    ll pro(ll x,ll y){return ((x%mod)*(y%mod))%mod;}
    ll sum(ll x,ll y){return ((x%mod)+(y%mod))%mod;}
    ll dif(ll x,ll y){ll d =((x%mod)-(y%mod))%mod;if(d>=0){return d;}else{return d+mod;}}
    ll quo(ll x, ll y){return pro(x,pow(y,mod-2));}
    ll pow(ll x,ll y){
        if(y<=0){return 1;}
        if(y%2==0){ll d = pow(x,y/2);return ((d%mod)*(d%mod))%mod;}
        else{return (x*pow(x,y-1))%mod;}
    }
    void operator=(ll n){this->val = n%mod;}
    ll operator+(ll n){return sum(this->val,n);}
    ll operator-(ll n){return dif(this->val,n);}
    ll operator*(ll n){return pro(this->val,n);}
    ll operator/(ll n){return quo(this->val,n);}
    void operator+=(ll n){this->val = sum(this->val,n);}
    void operator-=(ll n){this->val = dif(this->val,n);}
    void operator*=(ll n){this->val = pro(this->val,n);}
    void operator/=(ll n){this->val = quo(this->val,n);}
    ll fac(ll x){
        //x! mod mod
        if(factable.size()<=x){
            ll s = factable.size();
            FOR(i,s,x+1){
                factable.push_back(pro(i,factable.back()));
                invtable.push_back(quo(1,factable.back()));
            }
        }
        if(x<0) return 1;
        else return factable[x];
    }
    ll facinv(ll x){
        if(invtable.size()<=x){
            ll s = invtable.size();
            FOR(i,s,x+1){
                factable.push_back(pro(i,factable.back()));
                invtable.push_back(quo(1,factable.back()));
            }
        }
        if(x<0) return 1;
        else return invtable[x];
    }
    ll com(ll x,ll y){
        //xCy mod mod = x!/((x-y)!*y!) mod mod
        if(x-y<y)return com(x,x-y);
        return pro(fac(x),pro(facinv(x-y),facinv(y)));
    }
};

string s;
ll q=0,n=1e5;
vector<vector<ll>> sc(4,vector<ll>(n+1,0));
vector<vector<ll>> f(4);
vector<vector<vector<ll>>> ss(4,vector<vector<ll>>(4,vector<ll>(n+1,0)));

ll pro(string s1){
    Modulo rtn;
    rtn = 0;
    int a = s1[0]-'A';
    int b = s1[1]-'A';
    int c = s1[2]-'A';
    vector<int> d = {a,b,c};
    ll qv = count(all(d),3);
    
    REP(i,f[a].size()){
        rtn+=ss[b][c][n]-ss[b][c][f[a][i]+1];
    }
    
    rtn*=rtn.pow(3,q-qv);
    return rtn.val;
}

int main(){
    cin >> s;
    n = s.size();
    
    REP(i,n){
        REP(j,4){
            sc[j][i+1] = sc[j][i];
        }
        if(s[i]-'A'>=0){
            f[s[i]-'A'].push_back(i);
            sc[s[i]-'A'][i+1]++;
        }else{
            //?と'D'を置き換える
            s[i] = 'D';
            q++;
            f[3].push_back(i);
            sc[3][i+1]++;
        }
        
    }
    
    REP(i,n){
        REP(j,4){
            REP(k,4){
                ss[j][k][i+1]=ss[j][k][i];
            }
        }
        if(s[i]-'A'==1||s[i]-'A'==3){
            ss[s[i]-'A'][2][i+1]+=sc[2][n]-sc[2][i+1];
            ss[s[i]-'A'][3][i+1]+=sc[3][n]-sc[3][i+1];
        }
        
    }
    Modulo res;
    res = 0;
    res+=pro("ABC");
    res+=pro("DBC");
    res+=pro("ADC");
    res+=pro("ABD");
    res+=pro("ADD");
    res+=pro("DBD");
    res+=pro("DDC");
    res+=pro("DDD");
    put(res.val);
    return 0;
}


Measured memory_bytes: 19824