#include <bits/stdc++.h> 
#define cs const
#define pb push_back
using namespace std;
#define fi first
#define se second 
cs int N = 2e6 + 5; 
cs int oo = 1e9; 
typedef long long ll; 
typedef pair <int, int> pi;

int n, m, B; 
int in[N], out[N];
char S[N];

int fi[N], nxt[N], to[N], ec = 0, frm[N];
void add(int x, int y){
    ++ out[x], ++ in[y];
    nxt[++ec] = fi[x], fi[x] = ec ,to[ec] = y, frm[ec] = x;
}
int vis[N];
vector <int> seq; 
void dfs(int u){
	for(int &i = first[u]; i; i = nxt[i]){
		int t = to[i]; int j = i;
		if(!vis[j]){ vis[j] = 1; dfs(t); seq.pb(j); }
	}
}


int main() {
    #ifdef FSYo
    freopen("1.in","r",stdin);
    #endif
    cin >> n >> m >> B; 
    vector <pair <int, int> > E; 
    for(int i = 1; i <= n; i++) {
        scanf("%s", S + 1); 
        vector <int> p; 
        int len = strlen(S + 1);
        // cout << S + 1 << endl; 
        for(int j = 1; j <= len; j++) {
            if(S[j] == '1') p.pb(j);
        }
        // for(int x : p) cout << x << ' '; cout << endl;
        if(p[0] > m) {
            puts("-1");
            return 0; 
        }
        int a = (B + m - p[0]) % m; 
        bool ok = 1; 
        for(int i = 1; i < p.size(); i++) {
            if(p[i] - p[i - 1] != m) ok = 0; 
        }
        if(ok == 0) {
            puts("-1");
            return 0; 
        }
        int b = (a + len) % m; 
        E.pb(pair <int, int> (a, b));
        // cout << a << ' ' << b << endl;
    }
    for(int i = n - 1; ~i ; i--)
        add(E[i].first, E[i].second);
    for(int i = 0; i < m; i++)
    if(in[i] != out[i]) {
        puts("-1");
        return 0;
    }
    dfs(0);
    reverse(seq.begin(), seq.end());
    if(seq.size() < n) {
        puts("-1");
        return 0; 
    }
    for(int x : seq) cout << n - x + 1 << ' ';
    return 0; 
}