#include <cstdio>
#include <queue>
#include <vector>
#include <fstream>

using namespace std;

vector <int> a[100003];
queue <int> q;
int n,m,s,d[100003],x,y;

int main()
{
    int i;
    ifstream f ("bfs.in");
    f>>n>>m>>s;
    d[m]=-1;
    for (i=1;i<=m;i++)
    {
        f>>x>>y;
        a[x].push_back(y);
        d[i]=-1;
    }
    d[s]=0;
    q.push(s);
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        for(i=0;i<a[x].size();i++)
        {
            y=a[x][i];
            if(d[y]==-1)
            {
                q.push(y);
                d[y]=1+d[x];
            }
        }
    }
    ofstream g ("bfs.out");
    for(i=1;i<=n;i++)
    {
        g<<d[i]<<" ";
    }
    return 0;
}