#include<iostream>
#include<fstream>
#include<queue>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector<int>a[1000001];
queue <int> b;
int c[100001],el,n,m,s;
void dfs(int nod)
{
    c[nod]=1;
    b.push(nod);
    while (!b.empty())
    {
        el=b.front();
        b.pop();
        for (int i=0;i<a[el].size();i++)
        {
            if (c[a[el][i]]==0)
            {
                c[a[el][i]]=c[el]+1;
                b.push(a[el][i]);
            }
        }
    }
}
int main()
{
    fin>>n>>m>>s;
    for (int i=1;i<=m;i++)
    {
        int x,y;
        fin>>x>>y;
        a[x].push_back(y);
    }
    dfs(s);
    for (int i=1;i<=n;i++)
    {
        fout<<c[i]-1<<" ";
    }
}