For the ordinary matrix multiplication algorithm in Task 1 of Project 1, do we assume that the matrices are always square? So #define ROWS ... and #define COLS ... are the same number? As I understand it, if these numbers aren't the same, matrix multiplication isn't possible?

Or do we define 4 variables like #define ROWS1 ..., #define COLS1 ..., #define ROWS2..., and #define COLS2 ... and check at runtime that COLS1 and ROWS2 match up to allow multiplication?

I just assumed that all matrices are square and defined a constant N for both rows and columns. I hope our UC does not impose a strict limit on this. After all, these are just minor details; the main focus of the project should be on the parallel algorithm and its performance evaluation.