#include <iostream>
#include <algorithm>
#include <vector>
#include <ctime>

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

    int n, m, k, mn;
    std::cin >> n >> m;
    mn = m * n;
    std::vector<int> vectNM(mn);
    for (int i = 0; i < mn; ++i) {
        std::cin >> vectNM[i];
    }
    int km, ikm, ikm_km;
    k = 1;
    while (k < n) {
        ikm = 0;
        km = k * m;
        ikm_km = ikm + 2 * km;
        for (int i = 0; (i + 2) * k <= n; i += 2) {
            ikm = i * km;
            ikm_km = ikm + 2 * km;
            std::inplace_merge(
                vectNM.begin() + ikm,
                vectNM.begin() + ikm + km,
                vectNM.begin() + ikm_km);
        }
        if (vectNM.size() > ikm_km) {
            std::inplace_merge(
                vectNM.begin() + ikm,
                vectNM.begin() + ikm_km,
                vectNM.end());
        }
        k *= 2;
    }

    for (int i = 0; i < mn - 1; ++i) {
        std::printf("%d ", vectNM[i]);
    }
    std::cout << vectNM[mn - 1] << std::endl;
    return 0;
}