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

ifstream f("bfs.in");
ofstream g("bfs.out");
const int N=1000001;
int n,m,s,d[N];
queue <int> q;
vector <int> a[N];
void citire()
{
    int i,x,y;
    f>>n>>m>>s;
    for(i=1; i<=m; i++)
    {
        f>>x>>y;
        a[x].push_back(y);
        //a[y].push_back(x);
    }
}
void bfs(int x0)
{
    int x,y;
    q.push(x0);
    d[x0]=0;
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        for(unsigned i=0; i<a[x].size(); i++)
        {
            y=a[x][i];
            if(d[y]==-1)
            {
                q.push(y);
                d[y]=1+d[x];
            }
        }
    }
}
int main()
{
    int i;
    citire();
    for(i=1; i<=n; i++)
        d[i]=-1;
    bfs(s);
    for(i=1; i<=n; i++)
        g<<d[i]<<' ';
    return 0;
}