import java.util.*;


public class MatArith 
{
    // START CODE
	static int upper = 2147483647;
    static int lower = -2147483648;
    final static class Matrix
    {
        public static double[][] multiply(double[][] a, double[][] b)
        {
            if (a.length != b[0].length)
            {
                return null;
            }
            int rows = a.length;
            int cols = b[0].length;
            double c[][] = new double[rows][cols];

            for (int i = 0; i < rows; i++) 
            {
                for (int j = 0; j < cols; j++) 
                {
                    for (int k = 0; k < a[0].length; k++) 
                    {
                        c[i][j] += a[i][k] * b[k][j];
                        if(c[i][j] > upper || c[i][j] < lower)
                        {
                        	return null;
                        }
                    }
                }
            }
            return c;
        }
	
        public static double[][] add(double[][] a, double[][] b)
        {
            if (a.length != b.length || a[0].length != b[0].length)
            {
                return null;
            }
            int rows = a.length;
            int cols = a[0].length;
            double c[][] = new double[rows][cols];

            for (int i = 0; i < rows; i++) 
            {
                for (int j = 0; j < cols; j++) 
                {
                    c[i][j] = a[i][j] + b[i][j];
                    if(c[i][j] > upper || c[i][j] < lower)
                   	{
                   		return null;
                   	}
                }
            }
            return c;
        }
	
        public static double[][] minus(double[][] a, double[][] b)
        {
            if (a.length != b.length || a[0].length != b[0].length)
            {
                return null;
            }
            int rows = a.length;
            int cols = a[0].length;
            double c[][] = new double[rows][cols];

            for (int i = 0; i < rows; i++) 
            {
                for (int j = 0; j < cols; j++) 
                {
                    c[i][j] = a[i][j] - b[i][j];
                }
            }
            return c;
        }
	
        public static int[][] convertToInt(double[][] a)
        {
            int rows = a.length;
            int cols = a[0].length;
            int[][] value = new int[rows][cols];

            for (int i = 0; i < rows; i++)
            {
                for (int j = 0; j < cols; j++)
                {
                    value[i][j] = (new Long(Math.round(a[i][j]))).intValue();
                }
            }
            return value;
        }
	
    }
    public String[] calculate(String[] A, String[] B, String[] C, String equation) 
    {
    	double[][] D = null;
    	StringTokenizer sz = new StringTokenizer(A[0], " ");
    	double[][] X = new double[A.length][sz.countTokens()];
    	for(int i = 0; i < A.length; i++)
    	{
    		sz = new StringTokenizer(A[i], " ");
    		int x = 0;
    		while(sz.hasMoreTokens())
    		{
    			X[i][x++] = Integer.parseInt(sz.nextToken());
    		}
    		
    	}
    	sz = new StringTokenizer(B[0]);
    	double[][] Y = new double[B.length][sz.countTokens()];
    	for(int i = 0; i < B.length; i++)
    	{
    		sz = new StringTokenizer(B[i]);
    		int x = 0;
    		while(sz.hasMoreTokens())
    		{
    			Y[i][x++] = Integer.parseInt(sz.nextToken());
    		}
    		
    	}
    	sz = new StringTokenizer(C[0]);
    	double[][] Z = new double[C.length][sz.countTokens()];
    	for(int i = 0; i < C.length; i++)
    	{
    		sz = new StringTokenizer(C[i]);
    		int x = 0;
    		while(sz.hasMoreTokens())
    		{
    			Z[i][x++] = Integer.parseInt(sz.nextToken());
    		}
    		
    	}
    	
    	
    	StringTokenizer st = new StringTokenizer(equation, "+");
    	while(st.hasMoreTokens())
    	{
    		double[][] E = null;
    		String z = st.nextToken();
    		StringTokenizer st2 = new StringTokenizer(z, "*");
    		if(st2.hasMoreElements())
    		{
    			while(st2.hasMoreTokens())
	    		{
	    			String s = st2.nextToken();
	    			if(s.equals("A"))
	    			{
	    				if(E == null)
	    				{
	    					E = X;
	    				}
	    				else
	    				{
	    					if((E = Matrix.multiply(E, X)) == null)
	    					{
	    						return new String[]{};
	    					}
	    				}
	    			}
	    			else if(s.equals("B"))
	    			{
	    				if(E == null)
	    				{
	    					E = Y;
	    				}
	    				else
	    				{
	    					if((E = Matrix.multiply(E, Y)) == null)
	    					{
	    						return new String[]{};
	    					}
	    				}
	    			}
	    			else if(s.equals("C"))
	    			{
	    				if(E == null)
	    				{
	    					E = Z;
	    				}
	    				else
	    				{
	    					if((E = Matrix.multiply(E, Z)) == null)
	    					{
	    						return new String[]{};
	    					}
	    				}
	    			}
	    		}
	    		if(D == null)
	    		{
	    			D = E;
	    		}
	    		else if((D = Matrix.add(D, E)) == null)
	    		{
	    			return new String[]{};
	    		}
	    	}
	    	else
	    	{
	    		if(z.equals("A"))
	    		{
	    			if(D == null)
	    			{
	    				D = X;
	    			}
	    			else
	    			{
	    				if((D = Matrix.add(D, X)) == null)
	    				{
	    					return new String[]{};
	    				}
	    			}
	    		}
	    		if(z.equals("B"))
	    		{
	    			if(D == null)
	    			{
	    				D = Y;
	    			}
	    			else
	    			{
	    				if((D = Matrix.add(D, Y)) == null)
	    				{
	    					return new String[]{};
	    				}
	    			}
	    		}
	    		if(z.equals("C"))
	    		{
	    			if(D == null)
	    			{
	    				D = Z;
	    			}
	    			else
	    			{
	    				if((D = Matrix.add(D, Z)) == null)
	    				{
	    					return new String[]{};
	    				}
	    			}
	    		}
	    	}
    	}
    	int[][] M = Matrix.convertToInt(D);
    	String[] J = new String[M.length];
    	for(int u = 0; u < M.length; u++)
    	{
    		J[u] = "";
    	}
    	for(int i = 0; i < M.length; i++)
    	{
    		for(int j = 0; j < M[i].length; j++)
    		{
    			J[i] += M[i][j] + " ";
    		}
    		J[i] = J[i].trim();
    	}
    	J[M.length - 1] = J[M.length - 1].trim();
    	return J;
    }
    // END CODE
}