#include <iostream>


using namespace std;

int pro1[101][101];
int pro2[101][101];
int res[101][101];

int main()
{
	int N, M, K;
	cin >> N >> M;
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < M; j++) {
			cin>>pro1[i][j];
		}
	}
	cin >> M >> K;
	for (int i = 0; i < M; i++) {
		for (int j = 0; j < K; j++) {
			cin >> pro2[i][j];
		}
	}

	for (int i = 0; i < N; i++) {
		for (int j = 0; j < K; j++) {
			for (int k = 0; k < M; k++) {
				res[i][j] += pro1[i][k] * pro2[k][j];
			}
			cout << res[i][j] << " ";
		}
		cout << endl;
	}
	
}

#include<iostream>
#include<algorithm>
#include<queue>

using namespace std;

int N, x;
priority_queue<int,vector<int>,greater<int>> pq1;
priority_queue<int> pq2;

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	cin >> N;

	for (int i = 0; i < N; i++) {
		cin >> x;
		if (x == 0)
			if (pq1.empty() && pq2.empty()) cout << "0\n";
			else {
				if (pq1.empty()) {
					cout << pq2.top() << '\n';
					pq2.pop();
				}
				else if (pq2.empty()) {
					cout << pq1.top() << '\n';
					pq1.pop();
				}
				else {
					if (pq1.top() < -pq2.top()) {
						cout << pq1.top() << '\n';
						pq1.pop();
					}
					else {
						cout << pq2.top() << '\n';
						pq2.pop();
					}
				}
			}
		}
		else if (x > 0) pq1.push(x);
		
		else pq2.push(x);
			
	}

}

#include <iostream>

using namespace std;

int N, M;
char map[101][101]; 
bool visit[101][101]; 
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
int ans = 10001;

void dfs(int x, int y, int depth) {
	if (x<0 || y<0 || x>=N || y>=M) return; 
	if (x==N-1 && y==M-1) {
		if (depth < ans) ans = depth;
		return;
	}

	for (int i=0; i<4; i++){
		int xa = x+dx[i];
		int ya = y+dy[i];
		if (!visit[xa][ya] && map[xa][ya] == '1') {
			visit[xa][ya] = true;
			dfs(xa, ya, depth+1);
			visit[xa][ya] = false;
		}
	}
	
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
	
    scanf("%d %d", &N, &M); 
	for (int i=0; i<N; i++) scanf("%s", map[i]);
	
	dfs(0, 0, 1);
	printf("%d\n", ans);
}

#include <functional>
#include <vector>
#include <queue>
#include <iostream>  

using namespace std;

priority_queue<int, vector<int>, greater<int> > pq;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);

    int N;
    scanf("%d", &N);
    for (int i=0; i<N; i++) {
        int x;
        cin >> x;

        if (x!=0) pq.push(x);
        else {
            if (!pq.empty()) {
                cout << pq.top() << endl;
                pq.pop();
            }
            else cout << 0 << endl;
        }
    } 
    return 0;
}

#include <iostream>
#include <queue>
#include <utility>

using namespace std;
 
pair<int, int> p; 
queue<pair<int, int>> q;

int dx[4] = { 1, 0, -1, 0 };
int dy[4] = { 0, 1, 0 , -1 };
 
int n, m, result = 0;
int graph[1001][1001];
 
bool inside(int ny, int nx) {
    return (0 <= nx && 0 <= ny && nx < m && ny < n);
}
 
void bfs(void) {
    while (!q.empty()) {
        int y = q.front().first;
        int x = q.front().second;
        q.pop();
 
        for (int i=0; i<4; i++) {
            int ny = y + dy[i];
            int nx = x + dx[i];
 
            if (inside(ny,nx) && graph[ny][nx] == 0) {
                graph[ny][nx] = graph[y][x] + 1;
                pair<int, int> temp = make_pair(ny, nx);
                q.push(temp);
            }
        }
    }
}
 
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    
    int m,n;
    cin >> m >> n;

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cin >> graph[i][j];
            if (graph[i][j] == 1) { 
                pair<int, int> temp = make_pair(i,j);
                q.push(temp);
            }
        }
    }

    bfs();
 
    for (int i=0; i<n; i++) {
        for (int j=0; j<m; j++) {
            if (graph[i][j] == 0) { 
                cout << "-1" << endl;
                return 0;
            }
            if (result < graph[i][j]) {
                result = graph[i][j];
            }
        }
    }
    cout << result-1 << endl;
    return 0;
}