#include <iostream>
#include <fstream>
#include <queue>
using namespace std;

int nivele ( int y, int* tata)
{
    if(y==0)
        return -1;

    return 1 + nivele(tata[y], tata);
}

void BFS(int sursa, const vector<vector<int>> &la, int n, ofstream &fout)
{
    int *viz = new int[n+1];
    int *tata = new int[n+1];
    queue<int> c;

    for(int i=1; i<=n; i++)
        viz[i] = tata[i] = 0;

    viz[sursa] = 1;
    c.push(sursa);

    while(!c.empty())
    {
        int u = c.front();
        c.pop();

        for(unsigned i=0; i< la[u].size(); i++)
        {
            int v = la[u][i];
            if(!viz[v])
            {
                tata[v] = u;
                viz[v] = 1;
                c.push(v);
            }
        }
    }


    for(int i=1; i<=n; i++){
        if(viz[i] != 0){
          fout << nivele(i, tata) << " ";
        }
        else
            fout << -1 << " ";
    }
}

int main()
{
    ifstream fin ("bfs.in");
    ofstream fout ("bfs.out");

    int n, m, s;
    fin >> n >> m >> s;

    vector<vector<int>> la(n+1);
    for(int i=1; i<=m; i++)
    {
        int x, y;
        fin >> x >> y;
        la[x].push_back(y);
    }
    fin.close();

    BFS(s, la, n, fout);

    fout.close();
    return 0;
}