/*
* C++11 code template for contests.
* @author: Andrei Kalendarov
* @e-mail: andreykalendarov@gmail.com
*/

//#define ANDREIKKAA_ALLOCATOR
const int _ML = 228;

const char _inpf[] =
#if defined(ANDREIKKAA)
"input.txt"
#else
""
#endif
;
const char _outf[] =
#if defined(ANDREIKKAA)
""
#else
""
#endif
;

#if defined(ANDREIKKAA)
#undef NDEBUG
#else
#pragma GCC optimize("O3,no-stack-protector")
#endif
#include <bits/stdc++.h>
#if !defined(ANDREIKKAA)
#define endl '\n'
#endif
#define x first
#define y second
using namespace std;
#define rand abcdefghijklmnopqrstuvwxyz
#define random_shuffle abcdefghijklmnopqrstuvwxyz
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef double ld;
const ld PI = 3.14159265358979323846;
mt19937 rd(228);
#if defined(ANDREIKKAA_ALLOCATOR)
char _mem[_ML * 1024 * 1024];
size_t _ptr = 0;
inline void* operator new (size_t _x) { _ptr += _x; assert(_ptr < _ML * 1024 * 1024); return _mem + _ptr - _x; }
inline void operator delete (void*) { }
#endif
template<class T, class U> inline ostream &operator<<(ostream &, const pair<T, U> &);
template<class T, class U> inline istream &operator>>(istream &, pair<T, U> &);
template<class T> inline ostream &operator<<(ostream &, const vector<T> &);
template<class T> inline istream &operator>>(istream &, vector<T> &);
template<class T> inline ostream &operator<<(ostream &, const set<T> &);
template<class T> inline ostream &operator<<(ostream &, const multiset<T> &);
template<class T> inline ostream &operator<<(ostream &, const unordered_set<T> &);
template<class T> inline ostream &operator<<(ostream &, const unordered_multiset<T> &);
template<class T, class U> inline ostream &operator<<(ostream &, const map<T, U> &);
template<class T, class U> inline ostream &operator<<(ostream &, const unordered_map<T, U> &);

/* ________ CODE ________ */

const ll M = 1'000'000'007;

ll add(ll a, ll b)
{
    return (a + b) % M;
}

ll mul(ll a, ll b)
{
    return (a * b) % M;
}

ll pw(ll a, ll b)
{
    ll r = 1;
    while(b)
    {
        if(b & 1)
        {
            r = mul(r, a);
        }
        a = mul(a, a);
        b >>= 1;
    }
    return r;
}

vector<ll> f(string s, char c)
{
    int n = sz(s);
    vector<ll> ans(n);
    
    ll cc = 0;
    ll cq = 0;
    for(int i = 0; i < n; ++i)
    {
        if(i)
        {
            //ans[i] = ans[i - 1];
        }
        
        if(s[i] == c)
        {
            ++cc;
        }
        if(s[i] == '?')
        {
            ++cq;
        }
        
        ans[i] = add(ans[i], mul(cc, pw(3, cq)));
        if(cq)
        {
            ans[i] = add(ans[i], mul(cq, pw(3, cq - 1)));
        }
    }
    
    return ans;
}

inline void _main_function()
{
    string s;
    cin >> s;
    
    auto pf = f(s, 'A');
    reverse(all(s));
    auto sf = f(s, 'C');
    reverse(all(s));
    reverse(all(sf));
    
    ll ans = 0;
    for(int i = 1; i + 1 < sz(s); ++i)
    {
        if(s[i] == 'B' || s[i] == '?')
        {
            ans = add(ans, mul(pf[i - 1], sf[i + 1]));
        }
    }
    
    cout << ans << endl;
}

/* ________ CODE ________ */

int main() {
#if defined(ANDREIKKAA)
    time_t _start = clock();
#endif
    if (_inpf[0] != '\0') assert(freopen(_inpf, "r", stdin) != nullptr);
    if (_outf[0] != '\0') assert(freopen(_outf, "w", stdout) != nullptr);
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << setprecision(20);
    //cout << fixed;
    _main_function();
#if defined(ANDREIKKAA)
    cout << "Time: " << (clock() - _start) / (ld)CLOCKS_PER_SEC << endl;
#endif
}

template<class T, class U> inline ostream &operator<<(ostream &_out, const pair<T, U> &_p) {
    _out << _p.x << ' ' << _p.y;
    return _out;
}

template<class T, class U> inline istream &operator>>(istream &_in, pair<T, U> &_p) {
    _in >> _p.x >> _p.y;
    return _in;
}

template<class T> inline ostream &operator<<(ostream &_out, const vector<T> &_v) {
    if (_v.empty()) {
        return _out;
    }
    _out << *_v.begin();
    for (auto _it = ++_v.begin(); _it != _v.end(); ++_it) {
        _out << ' ' << *_it;
    }
    return _out;
}

template<class T> inline istream &operator>>(istream &_in, vector<T> &_v) {
    for (auto &_i : _v) {
        _in >> _i;
    }
    return _in;
}

template<class T> inline ostream &operator<<(ostream &_out, const set<T> &_s) {
    if (_s.empty()) {
        return _out;
    }
    _out << *_s.begin();
    for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) {
        _out << ' ' << *_it;
    }
    return _out;
}

template<class T> inline ostream &operator<<(ostream &_out, const multiset<T> &_s) {
    if (_s.empty()) {
        return _out;
    }
    _out << *_s.begin();
    for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) {
        _out << ' ' << *_it;
    }
    return _out;
}

template<class T> inline ostream &operator<<(ostream &_out, const unordered_set<T> &_s) {
    if (_s.empty()) {
        return _out;
    }
    _out << *_s.begin();
    for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) {
        _out << ' ' << *_it;
    }
    return _out;
}

template<class T> inline ostream &operator<<(ostream &_out, const unordered_multiset<T> &_s) {
    if (_s.empty()) {
        return _out;
    }
    _out << *_s.begin();
    for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) {
        _out << ' ' << *_it;
    }
    return _out;
}

template<class T, class U> inline ostream &operator<<(ostream &_out, const map<T, U> &_m) {
    if (_m.empty()) {
        return _out;
    }
    _out << '(' << _m.begin()->x << ": " << _m.begin()->y << ')';
    for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) {
        _out << ", (" << _it->x << ": " << _it->y << ')';
    }
    return _out;
}

template<class T, class U> inline ostream &operator<<(ostream &_out, const unordered_map<T, U> &_m) {
    if (_m.empty()) {
        return _out;
    }
    _out << '(' << _m.begin()->x << ": " << _m.begin()->y << ')';
    for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) {
        _out << ", (" << _it->x << ": " << _it->y << ')';
    }
    return _out;
}


Measured memory_bytes: 2000