The ABC number of a string T is the number of triples of integers (i, j, k) that satisfy all of the following conditions:

* 1 ≤ i < j < k ≤ |T| (|T| is the length of T.)
* T_i = `A` (T_i is the i-th character of T from the beginning.)
* T_j = `B`
* T_k = `C`



For example, when T = `ABCBC`, there are three triples of integers (i, j, k) that satisfy the conditions: (1, 2, 3), (1, 2, 5), (1, 4, 5). Thus, the ABC number of T is 3.

You are given a string S. Each character of S is `A`, `B`, `C` or `?`.

Let Q be the number of occurrences of `?` in S. We can make 3^Q strings by replacing each occurrence of `?` in S with `A`, `B` or `C`. Find the sum of the ABC numbers of all these strings.

This sum can be extremely large, so print the sum modulo 10^9 + 7.

Constraints

* 3 ≤ |S| ≤ 10^5
* Each character of S is `A`, `B`, `C` or `?`.

Input

Input is given from Standard Input in the following format:


S


Output

Print the sum of the ABC numbers of all the 3^Q strings, modulo 10^9 + 7.

Examples

Input

A??C


Output

8


Input

ABCBC


Output

3


Input

????C?????B??????A???????


Output

979596887
import java.util.*;
import java.lang.*;
import java.math.*;
import java.io.*;

/* spar5h */

public class Main implements Runnable{    
	
	final static long mod = (long)1e9 + 7;
	
	public void run() {
		
		InputReader s = new InputReader(System.in);
		PrintWriter w = new PrintWriter(System.out);
		
		char[] a = s.next().toCharArray();
		int n = a.length;
		
		long[] preA = new long[n];
		long[] sufC = new long[n];
		
		long[] preQ = new long[n];
		long[] sufQ = new long[n];
		
		for(int i = 1; i < n; i++) {
			
			preA[i] = preA[i - 1];
			
			if(a[i - 1] == 'A')
				preA[i]++;
			
			preQ[i] = preQ[i - 1];
			
			if(a[i - 1] == '?')
				preQ[i]++;
		}
		
		for(int i = n - 2; i >= 0; i--) {
			
			sufC[i] = sufC[i + 1];
			
			if(a[i + 1] == 'C')
				sufC[i]++;
			
			sufQ[i] = sufQ[i + 1];
			
			if(a[i + 1] == '?')
				sufQ[i]++;
		}
		
		long[] pow3 = new long[n + 1]; pow3[0] = 1;
		
		for(int i = 1; i <= n; i++)
			pow3[i] = (pow3[i - 1] * 3) % mod;
		
		long res = 0;
		int q = (int)(preQ[n - 1] + sufQ[n - 2]);
		
		for(int i = 0; i < n; i++) {
			
			if(a[i] == '?') {
				
				res = (res + preA[i] * sufC[i] % mod * pow3[q - 1] % mod) % mod;
				
				if(q - 2 >= 0) {
					res = (res + preA[i] * sufQ[i] % mod * pow3[q - 2] % mod) % mod;
					res = (res + preQ[i] * sufC[i] % mod * pow3[q - 2] % mod) % mod;
				}
				
				if(q - 3 >= 0)
					res = (res + preQ[i] * sufQ[i] % mod * pow3[q - 3] % mod) % mod;
			}
			
			else if(a[i] == 'B') {
				
				res = (res + preA[i] * sufC[i] % mod * pow3[q] % mod) % mod;
				
				if(q - 1 >= 0) {
					res = (res + preA[i] * sufQ[i] % mod * pow3[q - 1] % mod) % mod;
					res = (res + preQ[i] * sufC[i] % mod * pow3[q - 1] % mod) % mod;
				}
				
				if(q - 2 >= 0)
					res = (res + preQ[i] * sufQ[i] % mod * pow3[q - 2] % mod) % mod;
			}
			
		}
		
		w.println(res);
		
		w.close();
	}
	
	static class InputReader {
		
		private InputStream stream;
		private byte[] buf = new byte[1024];
		private int curChar;
		private int numChars;
		private SpaceCharFilter filter;
		
		public InputReader(InputStream stream)
		{
			this.stream = stream;
		}
		
		public int read()
		{
			if (numChars==-1) 
				throw new InputMismatchException();
			
			if (curChar >= numChars)
			{
				curChar = 0;
				try 
				{
					numChars = stream.read(buf);
				}
				catch (IOException e)
				{
					throw new InputMismatchException();
				}
				
				if(numChars <= 0)				
					return -1;
			}
			return buf[curChar++];
		}
	 
		public String nextLine()
		{
			BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
			String str = "";
            try
            {
                str = br.readLine();
            }
            catch (IOException e)
            {
                e.printStackTrace();
            }
            return str;
		}
		public int nextInt()
		{
			int c = read();
			
			while(isSpaceChar(c)) 
				c = read();
			
			int sgn = 1;
			
			if (c == '-') 
			{
				sgn = -1;
				c = read();
			}
			
			int res = 0;
			do 
			{
				if(c<'0'||c>'9') 
					throw new InputMismatchException();
				res *= 10;
				res += c - '0';
				c = read();
			}
			while (!isSpaceChar(c)); 
			
			return res * sgn;
		}
		
		public long nextLong() 
		{
			int c = read();
			while (isSpaceChar(c))
				c = read();
			int sgn = 1;
			if (c == '-') 
			{
				sgn = -1;
				c = read();
			}
			long res = 0;
			
			do 
			{
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res *= 10;
				res += c - '0';
				c = read();
			}
			while (!isSpaceChar(c));
				return res * sgn;
		}
		
		public double nextDouble() 
		{
			int c = read();
			while (isSpaceChar(c))
				c = read();
			int sgn = 1;
			if (c == '-') 
			{
				sgn = -1;
				c = read();
			}
			double res = 0;
			while (!isSpaceChar(c) && c != '.') 
			{
				if (c == 'e' || c == 'E')
					return res * Math.pow(10, nextInt());
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res *= 10;
				res += c - '0';
				c = read();
			}
			if (c == '.') 
			{
				c = read();
				double m = 1;
				while (!isSpaceChar(c)) 
				{
					if (c == 'e' || c == 'E')
						return res * Math.pow(10, nextInt());
					if (c < '0' || c > '9')
						throw new InputMismatchException();
					m /= 10;
					res += (c - '0') * m;
					c = read();
				}
			}
			return res * sgn;
		}
		
		public String readString() 
		{
			int c = read();
			while (isSpaceChar(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do 
			{
				res.appendCodePoint(c);
				c = read();
			} 
			while (!isSpaceChar(c));
			
			return res.toString();
		}
	 
		public boolean isSpaceChar(int c) 
		{
			if (filter != null)
				return filter.isSpaceChar(c);
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}
	 
		public String next() 
		{
			return readString();
		}
		
		public interface SpaceCharFilter 
		{
			public boolean isSpaceChar(int ch);
		}
	}
    
	public static void main(String args[]) throws Exception
	{
		new Thread(null, new Main(),"Main",1<<26).start();
	}
}