#include<fstream>
#include<vector>
#include<queue>
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
vector <int> g[100003];
queue <int> q;
int sol[100003];
bool viz[100003];
int main()
{
    int i,n,m,s,x,y,fr;
    in>>n>>m>>s;
    while(m--)
    {
        in>>x>>y;
        g[x].push_back(y);
    }
    for(i=1;i<=n;i++)
        sol[i]=-1;
    sol[s]=0;
    q.push(s);
    while(!q.empty())
    {
        fr=q.front();
        for(i=0;i<g[fr].size();i++)
        {
            if(viz[g[fr][i]]==0)
            {
                viz[g[fr][i]]=1;
                q.push(g[fr][i]);
                if(sol[g[fr][i]]==-1)
                    sol[g[fr][i]]=sol[fr]+1;
            }
        }
        q.pop();

    }
    for(i=1;i<=n;i++)
        out<<sol[i]<<" ";
    in.close();
    out.close();
    return 0;
}