#include<bits/stdc++.h> usingnamespace std; #define ll long long constint N = 1e4 + 10; constint INF = 0x3f3f3f3f; int n, m; int ans[510][510]; int gr[510], gc[510]; intmain(){ cin >> n >> m; if (n == 1 && m == 1) { puts("0"); return0; } if (n == 1) { for (int i = 1; i <= m; i++)ans[1][i] = i + 1; } elseif (m == 1) { for (int i = 1; i <= n; i++)ans[i][1] = i + 1; } else { ans[1][1] = 4, ans[1][2] = 12, ans[2][1] = 2, ans[2][2] = 9; gr[1] = 4, gr[2] = 1, gc[1] = 2, gc[2] = 3; int tot = 4; for (int i = 3; i <= m; i++) { tot++; gc[i] = tot; for (int j = 1; j <= 2; j++) { ans[j][i] = tot * gr[j]; } } for (int i = 3; i <= n; i++) { tot++; gr[i] = tot; for (int j = 1; j <= m; j++) { ans[i][j] = tot * gc[j]; } } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) printf("%d%s", ans[i][j], j == m ? "\n" : " "); } return0; }