For this Question: Given two matrices A and B of size (M x N) and (N x P) respectively, Find matrix C, the product of matrix A and B.

<a href="https://en.wikipedia.org/wiki/Matrix_multiplication">Matrix Multiplication</aThe first line contains three integers M, N, and P as mentioned in the problem statement.
Next M lines contain N integers denoting the elements of matrix A
Next N lines contain P integers denoting the elements of matrix B

<b>Constraints</b>
1 &le; M, N, P &le; 100
1 &le; A[i][j], B[i][j] &le; 100Print M lines each containing P integers denoting the elements of matrix C respectivelySample input 1:
2 2 2
1 0
0 1
2 3
1 0

Sample output 1:
2 3
1 0

<b>Explanation:</b>
[ [1 , 0] , [0 , 1] ] X [ [2 , 3] , [1 , 0] ]  = [ [2 , 3] , [1 , 0] ] , I have written this Solution Code: #include "bits/stdc++.h"
using namespace std;
 
#define int long long int
#define ld long double
#define pi pair<int, int>
#define pb push_back
#define fi first
#define se second
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#ifndef LOCAL
#define endl '\n'
#endif

const int N = 1e2 + 5;
const int mod = 1e9 + 7;
const int inf = 1e9 + 9;

int a[N][N], b[N][N], c[N][N];

void solve(){
	int m, n, p;
	cin >> m >> n >> p;
	for(int i = 1; i <= m; i++)
		for(int j = 1; j <= n; j++)
			cin >> a[i][j];
	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= p; j++)
			cin >> b[i][j];
	for(int i = 1; i <= m; i++){
		for(int j = 1; j <= n; j++){
			for(int k = 1; k <= p; k++)
				c[i][k] += a[i][j]*b[j][k];
		}
	}
	for(int i = 1; i <= m; i++){
		for(int j = 1; j <= p; j++)
			cout << c[i][j] << " ";
		cout << endl;
	}
}

void testcases(){
	int tt = 1; 
	//cin >> tt;
	while(tt--){
		solve();
	}
}

signed main() {
	IOS;
		clock_t start = clock();

	testcases();

	cerr << (double)(clock() - start)*1000/CLOCKS_PER_SEC << " ms" << endl;
	return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?