#include<bits/stdc++.h>

#define x first
#define y second
#define all(x) begin(x),end(x)
#define sz(x) (int)(x).size()
#define rep(i,a,b) for(int i=(a); i<(b); ++i)
#define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
#define ROF(i,a,b) for(int i=(a); i>=(b); --i)
#define pb push_back
#define eb emplace_back

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;

const int N = 200005;
vpii g[N];
int state[N];
char s[1000005];
vi ans;
int deg[N];

void dfs(int u) {
    if(state[u] < sz(g[u])) {
        int now = state[u];
        state[u]++;
        pii e = g[u][now];
        dfs(e.y);
        ans.eb(e.x);
    }
}

void solve() {
    int n, m, p;
    bool valid = true;
    scanf("%d %d %d",&n,&m,&p);
    rep(i,0,n){
        scanf(" %s",s);
        vi ones;
        int len = strlen(s);
        rep(j, 0, len) {
            if(s[j] == '1') ones.eb(j);
        }
        if(ones[0] > m-1 || len-ones.back() > m) {
            valid = false;
            continue;
        }
        rep(j, 0, sz(ones)-1) {
            if(ones[j+1]-ones[j] != m) {
                valid = false;
                break;
            }
        }
        if(!valid) continue;
        int a = (m-ones[0]-1)%m;
        int b = len-ones.back()-1;
        g[a].eb(i,b);
        deg[a]++;
        deg[b]--;
    }
    if(!valid) {
        printf("-1\n");
        return ;
    }
    int st = m-p;
    rep(i, 0, m) {
        sort(all(g[i]));
    }

    rep(i, 0, m){
        if(deg[i]) {
            valid = false;
            break;
        }
    }
    if(!valid) {
        printf("-1\n");
        return ;
    }

    dfs(st);
    rep(i, 0, m) {
        if(state[i] != sz(g[i])) {
            valid = false;
            break;
        }
    }

    if(!valid) {
        printf("-1\n");
        return ;
    }

    reverse(all(ans));
    rep(i, 0, n) {
        printf("%d ",ans[i]+1);
    }
    puts("");
}

int main() {
    solve();
    return 0;
}