#include <bits/stdc++.h> using namespace std; int main() { int n, m, k, a[105][105], b[105][105]; cin >> n >> m >> k; for (int i = 1; i <= n; i ++) { for (int j = 1; j <= m; j ++) cin >> a[i][j]; } for (int i = 1; i <= m; i ++) { for (int j = 1; j <= k; j ++) cin >> b[i][j]; } //n行m列的矩阵A * m行k列的矩阵B，得到的是矩阵C是n行k列的 for (int i = 1; i <= n; i ++) { for (int j = 1; j <= k; j ++) { int sum = 0; for (int p = 1; p <= m; p ++) { sum += a[i][p] * b[p][j]; } cout << sum << " "; } cout << endl; } return 0; }