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

using namespace std;

const int nmax=1e5+5;

vector<int> g[nmax];
queue<int> q;
int n,m,s;
int v[nmax];


int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    int node,x,y,z,sz,i;
    scanf("%d%d%d",&n,&m,&s);
    for(i=1;i<=m;i++)
    {
        scanf("%d%d",&x,&y);
        g[x].push_back(y);
    }
    for(i=1;i<=n;i++)
        v[i]=-1;
    v[s]=0;
    q.push(s);
    while(!q.empty())
    {
        node=q.front();
        sz=g[node].size();
        for(i=0;i<sz;i++)
        {
            if(v[g[node][i]]==-1)
            {
                q.push(g[node][i]);
                v[g[node][i]]=v[node]+1;
            }
        }
        q.pop();
    }
    for(i=1;i<=n;i++)
        printf("%d ",v[i]);
}