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

int n, m, b; 
int t[N]; 
char s[N]; 
map<int, set<int>> mp; 

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; 
        }
        t[i] = l; mp[res].insert(i); 
        // cout << res << " " << i << "\n"; 
    }
    vector<int> ans; 
    int nw = b - 1, sl = 0; 
    for (int op = 0; op < n; ++op)
        if (mp[nw].empty()) return cout << "-1\n", 0; 
        else {
            int x = *mp[nw].begin(); 
            ans.push_back(x); mp[nw].erase(mp[nw].begin()); 
            sl = (sl + t[x]) % m; 
            nw = (m - sl + b - 1) % m; 
            // cout << x << " " << nw << "\n"; 
        }
    for (int i : ans) cout << i << " "; 
    cout << "\n"; 
    return 0;
}

/*
5 4 3
00100010001000100010
*/