#include <fstream>
#include <vector>
#include <queue>
#define NMAX 100005

using namespace std;

FILE* f=freopen("bfs.in","r",stdin);
FILE* o=freopen("bfs.out","w",stdout);

int n,m;
vector<int> graph[NMAX];
int dist[NMAX];
queue<int> q;

void BFS(int x)
{
    q.push(x);
    dist[x]=1;
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        for(int i=0;i<graph[nod].size();++i)
        {
            int ind=graph[nod][i];
            if(dist[ind]) continue;
            dist[ind]=dist[nod]+1;
            q.push(ind);
        }
    }
}

int main()
{
    int s;
    scanf("%d%d%d",&n,&m,&s);

    for(int i=0;i<m;++i)
    {
        int x,y;
        scanf("%d%d",&x,&y);

        graph[x].push_back(y);
    }

    BFS(s);

    for(int i=1;i<=n;++i) printf("%d ",dist[i]-1);

    return 0;
}