#include <iostream>
#include <vector>
#include <fstream>
#include <queue>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");

bool vizitat[100001];
int n, m, s, distanta[100001];
vector<int> muchii_din[100001];
queue<int> coada;

void citire() {
    f>>n>>m>>s;
    int a, b;
    for(int i=0; i<m; i++) {
        f>>a>>b;
        muchii_din[a].push_back(b);
    }
}

void bfs(int i) {
    cout<<i<<": ";

    vizitat[i] = 1;

    for(int j : muchii_din[i]) {
        cout<<" _"<<j<<"_ ";

        if (vizitat[j] == 0) {

            coada.push(j);
            distanta[j] = distanta[i]+1;
            cout << "A";

        }
        cout<<endl;
    }

    if (!coada.empty()) {
        int x = coada.front();
        //cout<<x<<" ";
        coada.pop();
        bfs(x);
    }


}

int main() {
    citire();
    f.close();

    distanta[s]=1;
    bfs(s);

    for(int i=1; i<=n; i++)
        g<<distanta[i]-1<<' ';

    g.close();

}