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

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

vector <int> v[100001];
bool f[100001];
int s[100001];
queue <int> q;

void bfs(int node)
{
    f[node]=1;
    q.push(node);
    while (!q.empty())
    {
        node=q.front();
        for (int i=0; i<v[node].size(); i++)
        {
            if (f[v[node][i]]==0)
            {
                q.push(v[node][i]);
                f[v[node][i]]=1;
                s[v[node][i]]=s[node]+1;
            }
        }
        q.pop();
    }
}
int main()
{
    int n,m,x,y,i,start;
    fin>>n>>m>>start;
    for (i=0; i<m; i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
    bfs(start);
    for (i=1; i<=n; i++)
    {
        if (!f[i])
            fout<<-1<<" ";
        else
        {
            fout<<s[i]<<" ";
        }
    }
    return 0;
}