#include <cstdio>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define rep(i, l, r) for (int i = l; i <= r; ++i)
const int N = 1e6 + 5;
struct edge { int v, id; } ;  
int n, m, c, l, tp, st[N], cur[N], in[N], out[N]; char s[N]; 
vector <edge> G[N]; 

void add (int u, int v, int id) {
  ++in[v], ++out[u]; 
  G[u].push_back((edge){v, id}); 
}
void euler (int u) {
  for (int &i = cur[u]; i < G[u].size(); ) {
    int id = G[u][i].id; 
    ++i, euler(G[u][i - 1].v); 
    st[++tp] = id; 
  }
}

int main () {
  ios :: sync_with_stdio(0), cin.tie(0), cout.tie(0); 
  cin >> n >> m >> c;
  rep(i, 1, n) {
    cin >> (s + 1), l = strlen(s + 1); 
    int lst = 0, fst = 0; 
    rep(j, 1, l) if (s[j] == '1') {
      if (lst && (j - lst) != m) {
        cout << -1 << '\n'; return 0; 
      } 
      if (!lst) {
        fst = j; 
        if (j > m) { 
          cout << -1 << '\n'; return 0; 
        }
      }
      lst = j; 
    }
    if (l - lst >= m) { 
      cout << -1 << '\n'; return 0; 
    }
    add((c - fst + m) % m, (c - fst + l + m) % m, i); 
  }
  rep(i, 0, m - 1) if (in[i] != out[i]) {
    cout << -1 << '\n'; return 0; 
  } 
  rep(i, 0, m - 1) sort(G[i].begin(), G[i].end(), [](edge a, edge b) {
    return a.id < b.id; 
  }); 
  euler(0); 
  for ( ; tp; --tp) cout << st[tp] << ' '; cout << '\n'; 
  return 0; 
}