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

using namespace std;

const int N=1000001;

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

int main()
{
    int i;
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    scanf("%d%d%d",&n,&m,&s);
    d[m]=-1;
    while(m--)
    {
        scanf("%d%d",&x,&y);
        a[x].push_back(y);
        d[m]=-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];
            }
        }
    }
    for(i=1;i<=n;++i)
    {
        printf("%d ",d[i]);
    }
    return 0;
}