#include <fstream>
#include<vector>
#include<queue>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,s,x,y;
vector<vector<int> > la;
vector<int> dist;
queue<pair<int,int> > c;
int main()
{
    f>>n>>m>>s;la.resize(n+1);
    for(int i=1;i<=m;i++)
        {
            f>>x>>y;
            la[x].push_back(y);
        }
    dist.resize(n+1,-1);
    dist[s]=0;
    c.push(make_pair(s,0));
    while(!c.empty())
        {
            int nod=c.front().first;
            int d=c.front().second;
            c.pop();
            for(unsigned int i=0;i<la[nod].size();i++)
                if(dist[la[nod][i]]==-1)
                    {
                        dist[la[nod][i]]=d+1;
                        c.push(make_pair(la[nod][i],d+1));
                    }
        }
    for(int i=1;i<=n;i++)
        g<<dist[i]<<' ';
    g<<'\n';
    return 0;
}