osu!mania( finding # int the pattern)

#include <bits/stdc++.h>
using namespace std;

int main() {
    int t;
    cin >> t;
    while (t--) {
        int N;
        cin >> N;
        vector<int> results; // To store results for each test case
        for (int i = 0; i < N; i++) {
            string A;
            cin >> A;
            // Check if the string contains '#'
            for (int j = 0; j < min(4, (int)A.size()); j++) {
                if (A[j] == '#') {
                    results.push_back(j + 1);
                    reverse(results.begin(),results.end());
            // 1-based index
                    break; // Stop after finding the first '#'
                }
            }
        }
        // Output results for the current test case
        if (results.empty()) {
            cout << "-1 ";
        } else {
            for (int res : results) {
                cout << res << " ";
            }
        }
        cout << endl; // Print a newline after each test case
    }
    return 0;
}