#include <fstream>
#include <vector>
#include <queue>
using namespace std;

#define NMax 100005

ifstream f("bfs.in");
ofstream g("bfs.out");

int n,m;
int viz[NMax],gr[NMax];
vector<int> v[NMax];
queue<int> cd;

void DFS(int s)
{
    int i;
    cd.push(s);
    viz[s]=1;
    while(!cd.empty())
    {
        s=cd.front();
        cd.pop();
        viz[s]=1;
        for(i=0;i<v[s].size();++i) if(!viz[v[s][i]]) cd.push(v[s][i]), gr[v[s][i]]=gr[s]+1;
    }
}

int main()
{
    int i,a,b,s;

    f>>n>>m>>s;
    for(i=1;i<=m;++i)
    {
        f>>a>>b;
        v[a].push_back(b);
    }

    DFS(s);

    for(i=1;i<=n;++i)
        if(gr[i]==0 && i!=s) g<<"-1 ";
        else g<<gr[i]<<" ";
    g<<"\n";

    f.close();
    g.close();
    return 0;
}