#include <iostream>

#define fi first
#define se second
#define pb(x) push_back(x)
#define sqr(x) ((x)*(x))
#define sz(x) (int)x.size()
#define all(x) (x).begin(),(x).end()
#define cs(x) printf("Case %d: ", x)

using namespace std;
template <class T> inline void umax(T &x,T y) {if (y > x) x = y;}
template <class T> inline void umin(T &x,T y) {if (y < x) x = y;}
typedef long long ll;
typedef pair <int, int> pii;

const int N = 2e3 + 5, B = 0x7fffffff;
int a[N][N];
int n, m;

int main(){
  cin >> n >> m;
  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 <= n; j++){
      cout << a[j][i] << " ";
    }
    cout << "\n";
  }
  
  return !1;
}