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

using namespace std;

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

int n, m, s;
vector <int> v[100005];
queue <int> q;
int x, y;
int d[100005];

void bfs(int nod)
{
    for(int i=1; i<=n; i++)
        d[i]=-1;
    d[nod]=0;
    q.push(nod);
    while(!q.empty())
    {
        int current = q.front();
        q.pop();
        for(int vecin : v[current])
            if(d[vecin]==-1)
            {
                d[vecin] = d[current] + 1;
                q.push(vecin);
            }
    }
}

int main()
{
    fin>>n>>m>>s;
    for(int i=1; i<=m; i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
    bfs(s);
    for(int i=1; i<=n; i++)
        fout<<d[i]<<" ";
    return 0;
}