#include <fstream>
#include <vector>


using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
const int N=100010;
int n,m,s,x,y,ultimul=1,primul=1,distanta[N],coada[N];
vector<int> v[N];

int main()
{
    f>>n>>m>>s;
    for(; m; m--)
    {
        f>>x>>y;
        v[x].push_back(y);
    }
    coada[1]=s;
    distanta[s]=1;
    while(primul<=ultimul)
    {
        int nod=coada[primul++];
        for(auto vecin:v[nod])
            if(!distanta[vecin])
            {
                distanta[vecin]=distanta[nod]+1;
                coada[++ultimul]=vecin;
            }

    }
    for(int i=1; i<=n; i++)
        g<<distanta[i]-1<<' ';
    return 0;
}