using namespace std;
#include <iostream>
#include <bits/stdc++.h>

#define infile "../test/sample-1.in"
#define int long long
// #define INF 2147483647
#define INF 1000000000000000000LL
#define MOD 1000000007LL

// {{{ define basic macro
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define _rrep(i,n) repi(i,0,n)
#define rrepi(i,a,b) for(int i=(int)(b-1);i>=(int)(a);--i)
#define rrep(...) _overload3(__VA_ARGS__,rrepi,_rrep,)(__VA_ARGS__)

#define foreach(x,a) for(auto& (x) : (a) )
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)

#define all(x) (x).begin(),(x).end()
#define sum(v) accumulate(all(v), 0)
#define sz(x) ((int)(x).size())
template<class T> inline void chmax(T &a, const T &b) { if(a < b) a = b; }
template<class T> inline void chmin(T &a, const T &b) { if(a > b) a = b; }
// n次元配列の初期化。第２引数の型のサイズごとに初期化していく。
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
    std::fill( (T*)array, (T*)(array+N), val );
}
#define fill(x,y) memset(x,y,sizeof(x))
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define uni(x) sort(all(x));x.erase(unique(all(x)),x.end())
#define ten(n) ((int)1e##n)

template <class T = int>
T in() {T x; cin>>x; return (x);}

struct Fast {
  Fast(){
    std::cin.tie(0);
    ios::sync_with_stdio(false);
  }
} fast;
// }}}
//{{{ dump macro
#ifdef PCM
  #include "dump.hpp"
#else
  #define dump(...) 42
  #define dump_1d(...) 42
  #define dump_2d(...) 42
#endif
//}}}
//{{{ others
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int,int> pii;
typedef tuple<int,int,int> iii;
template<typename T>
using PQ = priority_queue<T, vector<T>, greater<T>>;

int dx[]={1, -1, 0, 0};
int dy[]={0, 0, 1, -1};
//}}}


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

  int n = sz(s);
  int a[n]={};
  int c[n]={};
  int h[n]={};
  if (s[0]=='A') { a[0] = 1; }
  if (s[0]=='C') { c[0] = 1; }
  if (s[0]=='?') { h[0] = 1; }
  rep(i, 1, sz(s)){
    a[i] = a[i-1];
    c[i] = c[i-1];
    h[i] = h[i-1];
    if (s[i]=='A') { a[i]++; }
    if (s[i]=='C') { c[i]++; }
    if (s[i]=='?') { h[i]++; }
  }

  dump_1d(a, n);
  dump_1d(c, n);
  dump_1d(h, n);

  int q=h[n-1];
  int res = 0;
  int qn[4] = {1,1,1,1};
  int tmp = 1;
  rep(i, q){
    tmp *= 3;
    tmp %= MOD;
    if (i==q-1) qn[0] = tmp;
    if (i==q-2) qn[1] = tmp;
    if (i==q-3) qn[2] = tmp;
    if (i==q-4) qn[3] = tmp;
  }
  // dump(q);
  dump_1d(qn, 4);
  rep(i, 1, n-1){
    if (s[i]=='B'){
      res += (a[i-1] * (c[n-1]-c[i]) %MOD) * qn[0] %MOD;
      res += (h[i-1] * (c[n-1]-c[i]) %MOD) * qn[1] %MOD;
      res += (a[i-1] * (h[n-1]-h[i]) %MOD) * qn[1] %MOD;
      res += (h[i-1] * (h[n-1]-h[i]) %MOD) * qn[2] %MOD;
    }
    if (s[i]=='?'){
      res += (a[i-1] * (c[n-1]-c[i]) %MOD) * qn[1] %MOD;
      res += (h[i-1] * (c[n-1]-c[i]) %MOD) * qn[2] %MOD;
      res += (a[i-1] * (h[n-1]-h[i]) %MOD) * qn[2] %MOD;
      res += (h[i-1] * (h[n-1]-h[i]) %MOD) * qn[3] %MOD;
    }
  }

  cout << res%MOD << endl;

  return 0;
}

int test(){ //{{{
  return 0;
}
//}}}

signed main() { //{{{
#ifdef INPUT_FROM_FILE
  std::ifstream in(infile);
  std::cin.rdbuf(in.rdbuf());
#endif
#ifdef PCM
  test();
#endif
  solve();
  return 0;
} //}}}


Measured memory_bytes: 2768