#include<fstream>
#include<vector>
#include<queue>
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
vector<int>v[100001];
queue<int>q;
int viz[100001];
void BFS(int nod)
{
    int nn,i;
    viz[nod]=0;
    q.push(nod);
    while(!q.empty())
    {
        nn=q.front();
        q.pop();
        for(i=0;i<v[nn].size();i++)
        {
            if(viz[v[nn][i]]>viz[nn]+1)
            {
                viz[v[nn][i]]=viz[nn]+1;
                q.push(v[nn][i]);
            }
        }
    }
}
int main()
{
    int n,m,s,i,a,b;
    in>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        in>>a>>b;
        v[a].push_back(b);
    }
    for(i=1;i<=n;i++)
        viz[i]=1e9;
    BFS(s);
    for(i=1;i<=n;i++)
    {
        if(viz[i]==1e9)
            out<<-1<<" ";
        else
            out<<viz[i]<<" ";
    }
    return 0;
}