import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv, std.math,
    std.functional, std.numeric, std.range, std.stdio, std.string, std.random,
    std.typecons, std.container, std.format;

// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] lreads(T = long)(long n){return generate(()=>readln.chomp.to!T()).take(n).array();}
T[] aryread(T = long)(){return readln.split.to!(T[])();}
void scan(TList...)(ref TList Args){auto line = readln.split();
foreach (i, T; TList){T val = line[i].to!(T);Args[i] = val;}}
alias sread = () => readln.chomp();enum MOD = 10 ^^ 9 + 7;
alias PQueue(T, alias less = "a<b") = BinaryHeap!(Array!T, less);
// dfmt on

void main()
{
    auto S = sread();
    auto dp = new long[][](4, S.length + 1);
    dp[0][0] = 1;
    foreach (i; 0 .. S.length)
    {
        dp[0][i + 1] = dp[0][i];
        dp[1][i + 1] = dp[1][i];
        dp[2][i + 1] = dp[2][i];
        dp[3][i + 1] = dp[3][i];
        if (S[i] == 'A')
        {
            dp[1][i + 1] += dp[0][i];
        }
        if (S[i] == 'B')
        {
            dp[2][i + 1] += dp[1][i];
        }
        if (S[i] == 'C')
        {
            dp[3][i + 1] += dp[2][i];
        }
        if (S[i] == '?')
        {
            // writeln(i);
            dp[1][i + 1] += dp[0][i];
            dp[2][i + 1] += dp[1][i];
            dp[3][i + 1] += dp[2][i];

            dp[0][i + 1] += dp[0][i] * 2;
            dp[1][i + 1] += dp[1][i] * 2;
            dp[2][i + 1] += dp[2][i] * 2;
            dp[3][i + 1] += dp[3][i] * 2;
        }
        dp[0][i + 1] %= MOD;
        dp[1][i + 1] %= MOD;
        dp[2][i + 1] %= MOD;
        dp[3][i + 1] %= MOD;
    }
    // writeln(dp[0]);
    // writeln(dp[1]);
    // writeln(dp[2]);
    // writeln(dp[3]);
    writeln(dp[3][S.length]);
}
