#include <bits/stdc++.h>
using namespace std;
#define FINISH cerr << "FINISH" << endl;
#define debug(x) cerr << #x << " == " << x << endl
#define el '\n'
#define fir first
#define sec second
typedef long long ll;
typedef pair<int, int> PII;
const int mod = 1000000007;
const int inf = 0x3f3f3f3f;
const int N = 200020;
void solve()
{
	int n, m, d, mx = -1;
	cin >> n >> m >> d;
	vector<vector<PII>> edge(m + 1);
	for (int i = 1; i <= n; i++) {
		string s;
		cin >> s;
		int st = 0;
		for (int i = 0; s[i]; i++) {
			if (s[i] == '1') {
				st = i;
				break;
			}
		}
		if (st + 1 == d) {
			mx = max(mx, i);
		}
		int cnt = 0;
		for (int i = st + 1; s[i]; i++) {
			if (i % m == st && s[i] == '0') {
				cout << "-1" << el;
				return;
			}
			if (i % m != st && s[i] == '1') {
				cout << "-1" << el;
				return;
			}
			if (s[i] == '0') {
				cnt++;
			}
			else {
				cnt = 0;
			}
		}
		if (st >= m || cnt >= m) {
			cout << "-1" << el;
			return;
		}
		edge[st].push_back(PII(m - 1 - cnt, i));
		// cout << "addedge " << st << " " << m - 1 - cnt << " " << i << endl;
	}
	for (int i = 0; i <= m; i++) {
		sort(edge[i].begin(), edge[i].end(),
			 [&](PII x, PII y) { return x.sec < y.sec; });
	}
	if (mx == -1) {
		cout << "-1" << el;
		return;
	}
	if (n == 1) {
		cout << "1" << el;
		return;
	}
	/*for (int i = 0; i < m; i++) {
		for (auto [to, w] : edge[i]) {
			cout << i << " " << to << " " << w << endl;
		}
	}*/
	int st = d - 1;
	vector<int> b(n + 1, 0);
	vector<int> ans;
	function<void(int)> dfs = [&](int x) {
		for (int i = b[x]; i < edge[x].size();) {
			b[x] = i + 1;
			ans.push_back(edge[x][i].sec);
			dfs(edge[x][i].fir);
			break;
		}
	};
	dfs(st);
	if (ans.size() != n) {
		cout << "-1" << el;
		return;
	}
	for (int i = 0; i < ans.size(); i++) {
		cout << ans[i] << " ";
	}
	cout << el;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int T = 1;
	// cin >> T;
	while (T--) {
		solve();
	}
	return 0;
}