#include<iostream>
#include<fstream>
#include<vector>
#include<queue>
using namespace std;
const int NMAX=10e5;
int d[NMAX];
int vis[NMAX+1];
vector<int>G[NMAX];

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

void BFS(int x)
{
    queue<int>q;
    q.push(x);
    d[x] = 0;
    vis[x]=1;
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        for(auto next:G[x])
        {
            if(!vis[next])
            {
                q.push(next);
                vis[next] = 1;
                d[next] = d[x] + 1;
            }
        }
    }
}
int main()
{
    int n, m, s=0;
    fin >> n >> m >> s;
    for(int i=1 ;i<=m; i++)
    {
        int x, y;
        fin >> x >> y;
        G[x].push_back(y);
    }
    BFS(s);
    for(int i=1;i<=n;i++)
    {
        if(d[i] == 0 && s==i)
            fout << 0 << " ";
        else if(d[i] == 0)
            fout<<-1<<" ";
        else fout<<d[i] << " ";
    }
    return 0;
}