#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5; 

int n, m, b; 
int cur[N]; 
char s[N]; 
vector<pair<int, int>> G[N]; 
vector<int> path; 

void dfs(int x) {
    for (int &i = cur[x]; i < G[x].size(); ) 
        path.push_back(G[x][i].second), dfs(G[x][i++].first);  
}

int main(void) {
    ios::sync_with_stdio(0); 
    cin >> n >> m >> b; 
    for (int i = 1; i <= n; ++i) {
        cin >> s; int l = strlen(s), res = -1; 
        for (int j = 0; j < l; ++j) 
            if (s[j] == '1') {
                if (res == -1) res = j % m; 
                else if (res != j % m) return cout << "-1\n", 0; 
            }
        for (int j = 0; j < l; ++j) {
            if (j % m == res && s[j] != '1') return cout << "-1\n", 0; 
            if (j % m != res && s[j] == '1') return cout << "-1\n", 0; 
        }
        int c1 = 0, c2 = 0; 
        for (int j = 0; j < l; ++j)
            if (s[j] == '1') break; 
            else ++c1; 
        for (int j = l - 1; j >= 0; --j)
            if (s[j] == '1') break; 
            else ++c2; 
        G[c1].emplace_back(m - 1 - c2, i); 
    }
    dfs(b - 1); 
    if (path.size() == n) {
        for (int i : path) cout << i << " "; 
        cout << "\n"; 
        return 0; 
    }
    cout << "-1\n"; 
    return 0;
}

/*
10 5 3
000010000100
0001000010000100001
000100
00010

0010
00001000010000100001000010

00010000100

00010


001
001000010
*/