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

using namespace std;

vector<int> v[100010];
char vaz[100010];
queue<int> q;

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