#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
bool compare(vector<int>& a, vector<int>& b) {
    return lexicographical_compare(a.begin(), a.end(), b.begin(), b.end());
}
int main() {
    int n, m;
    cin >> n >> m;
    vector<vector<int>> sequences(n);
    for (int i = 0; i < n; i++) {
        int firstTerm;
        cin >> firstTerm;
        
        sequences[i].push_back(firstTerm);
        for (int j = 1; j <= m; j++) {
            sequences[i].push_back(sequences[i][j-1] * (i+1));
        }
    }
    vector<int> indices(n);
    for (int i = 0; i < n; i++) {
        indices[i] = i+1;
    }
    sort(indices.begin(), indices.end(), [&sequences](int a, int b) {
        return compare(sequences[a-1], sequences[b-1]);
    });
    for (int i = 0; i < n; i++) {
        cout << indices[i] << " ";
    }
    
    return 0;
}

求优化！