#include <iostream>
#include <queue>
using namespace std;
int main() {
    int n, v, counter = 0;
    cin >> n >> v;
    queue <int> plan;
    plan.push(--v);
    int matrix[n][n];
    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
            cin >> matrix[i][j];
    while (!plan.empty()) {
        v = plan.front();
        plan.pop();
        if (!matrix[v][v]) {
            for (int j = 0; j < n; j++)
                if (matrix[v][j] and !matrix[j][j]) plan.push(j);
            matrix[v][v] = 1;
            counter++;
        }
    }
    cout << counter << endl;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8cXVldWU+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmludCBtYWluKCkgewogICAgaW50IG4sIHYsIGNvdW50ZXIgPSAwOwogICAgY2luID4+IG4gPj4gdjsKICAgIHF1ZXVlIDxpbnQ+IHBsYW47CiAgICBwbGFuLnB1c2goLS12KTsKICAgIGludCBtYXRyaXhbbl1bbl07CiAgICBmb3IgKGludCBpID0gMDsgaSA8IG47IGkrKykKICAgICAgICBmb3IgKGludCBqID0gMDsgaiA8IG47IGorKykKICAgICAgICAgICAgY2luID4+IG1hdHJpeFtpXVtqXTsKICAgIHdoaWxlICghcGxhbi5lbXB0eSgpKSB7CiAgICAgICAgdiA9IHBsYW4uZnJvbnQoKTsKICAgICAgICBwbGFuLnBvcCgpOwogICAgICAgIGlmICghbWF0cml4W3ZdW3ZdKSB7CiAgICAgICAgICAgIGZvciAoaW50IGogPSAwOyBqIDwgbjsgaisrKQogICAgICAgICAgICAgICAgaWYgKG1hdHJpeFt2XVtqXSBhbmQgIW1hdHJpeFtqXVtqXSkgcGxhbi5wdXNoKGopOwogICAgICAgICAgICBtYXRyaXhbdl1bdl0gPSAxOwogICAgICAgICAgICBjb3VudGVyKys7CiAgICAgICAgfQogICAgfQogICAgY291dCA8PCBjb3VudGVyIDw8IGVuZGw7Cn0=

NSAxCjAgMSAxIDAgMAoxIDAgMSAwIDAKMSAxIDAgMCAwCjAgMCAwIDAgMQowIDAgMCAxIDA=

5 1
0 1 1 0 0
1 0 1 0 0
1 1 0 0 0
0 0 0 0 1
0 0 0 1 0