import java.util.*;
public class Solution {
    public static List<List<Integer>> matrixMultiplication(List<List<List<Integer>>> matrices) {

        List<List<Integer>> finalMatrix = new ArrayList<List<Integer>>();

        List<Integer> temp = new ArrayList<Integer>();

        int rowsNextMatrix=0;
        int size=0;
        int matricesSize=matrices.size();
        int posInList=0;
        int numElementsInList=0;
        int counter=0;
        int i;
        int position=0;
        boolean hasTransposed=false;
        List<List <Integer>> matrix;
        boolean hasStartMatrix=true;
        boolean hasPerformedValidation=false;
        int numElementsInRow=0;

        int matrixNumber=0;
        
        //The following structure will ensure that
        //each each matrix can be obtained from the matrices
        //We have to remember that inner Lists can still be accessed via their index locations. This can be obtained via .get
        //We know that similar to other transposing matrix challenge, we can obtain the size (matrices) which will output the number of elements..
        //We know in this case this deals with List<List<Integer>>
        //We can now formulate a do while loop which would process the List<List<Integer>> within matrices until it reaches the size of matrices.

        do
        {
            matrix=matrices.get(counter);
            System.out.println("Matrix" +"("+counter+"): "+ matrix);

            




        for (List<Integer> ee: matrix)
        {
            for (int k: ee)
            {
                //I am now choosing to look ahead at the next matrix as soon as a number appears on the screen.
                //The only exception of course is the final matrix since it would have been processed by penultimate matrix.
                if(counter!=matricesSize-1)
                {
                    //if (ee.size())

                }

                if (matrixNumber<counter && hasStartMatrix)
                {
                    System.out.println("This is first integer in next matrix: " + k);
                    hasStartMatrix=false;   
                }

                numElementsInList++;
                numElementsInRow++;
                System.out.println(k);
            }
            

            //Using this technique will also ensure that I can check if the matrix is valid dimension and terminate the application
            //WE KNOW THAT NUMBER columns in Matrix A should match rows Matrix B

            if(counter!=(matricesSize-1) && !hasPerformedValidation)
            {
                for (List<Integer> rows: matrices.get((counter+1)))
                {
                    rowsNextMatrix++;
                }

                    if (numElementsInRow!=rowsNextMatrix)
                    {
            System.out.println("columns in Matrix A" + "("+numElementsInRow+")"+ "should match rows Matrix B " +  "("+rowsNextMatrix+")");
                        System.exit(0);
                    }
                    else
                    {
                        System.out.println("columns in Matrix A " + "("+numElementsInRow+")" + " rows Matrix B: " + "("+rowsNextMatrix+")");
                    }
                    hasPerformedValidation=true;
            }

            numElementsInRow=0;

            //break;
        }
        matrixNumber=counter;
        counter++;
        hasStartMatrix=true;
        hasPerformedValidation=false;
        rowsNextMatrix=0;

        }while (counter<matricesSize);

        System.out.println("num elements: " + numElementsInList);

        return finalMatrix;
    }
}