#include using namespace std; #define FOR(i,m,n) for(int i=(m);i<(n);++i) #define REP(i,n) FOR(i,0,n) using ll = long long; constexpr int INF = 0x3f3f3f3f; constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL; constexpr double EPS = 1e-8; constexpr int MOD = 998244353; // constexpr int MOD = 1000000007; constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1}; constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}; constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1}; template inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; } template inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; } struct IOSetup { IOSetup() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << fixed << setprecision(20); } } iosetup; int main() { int n, m; cin >> n >> m; vector a(m); for (int& a_i : a) cin >> a_i; vector t(n, vector(m, 0)); for (vector& t_i : t) for (int& t_ij : t_i) cin >> t_ij; set students; REP(i, n) students.emplace(i); vector ans(n); REP(j, m) { for (auto it = students.begin(); it != students.end();) { const int lab = t[*it][j]; if (a[lab] > 0) { ans[*it] = lab; --a[lab]; it = students.erase(it); } else { it = next(it); } } } REP(i, n) cout << ans[i] << " \n"[i + 1 == n]; return 0; }