Kayaks

#include <iostream>
#include <queue>
using namespace std;
int n, m; 
string str; 
int map[10], cnt;  bool q[31]; int prefix[31];
int main() {
    cin >> n >> m;
    for (int i=0; i<n; i++) {
        cin >> str;
        for (int j=0; j<m; j++) {
            if (str[j] <= '9' && str[j] > '0') {
                map[str[j]-'0'] = m-j-3;
                q[m-j-3] = true;
                break;
            }
        }
    }
    
    for (int i=1; i<31; i++) {
        if (!q[i]) {
            prefix[i] += 1;
        }
        prefix[i] = prefix[i-1] + prefix[i];
    } 

    // for (auto i:prefix) cout << i << " "; cout << endl;
    for (int i=1; i<10; i++) {
        if (map[i])
            cout << map[i] - prefix[map[i]] << "\n";
    }
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED