#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

void BFS (int nod,int n,const vector<vector<int>>&G)
{
    queue<int> q;
    vector<int>dist(n+1,n+1);


    q.push(nod);
    dist[nod]=0;

    while(!q.empty())
    {
        int x=q.front();
        q.pop();

        for (auto vecin:G[x])
            if (dist[vecin]>dist[x]+1)
            {
                dist[vecin]=dist[x]+1;
                q.push(vecin);
            }
    }


    for (int i=1; i<=n; i++)
    {
        if (dist[i]==n+1)
            dist[i]=-1;
        g<<dist[i]<<" ";
    }
}

int main()
{
    int n,m,x,y,start;

    f>>n>>m>>start;

    vector<vector<int>> G(n+1);

    for (int i=1; i<=m; i++)
    {
        f>>x>>y;
        G[x].push_back(y);
    }

    BFS (start,n,G);
}