#include <fstream>
#include <vector>
#include <algorithm>
#include <queue>

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

const int NMAX = 100005;
vector<int>G[NMAX];
int viz[NMAX];

int n,m;

void bfs(int s)
{
    queue<int>q;
    viz[s] = 1;
    q.push(s);
    while(!q.empty())
    {
        int fr = q.front();
        q.pop();
        for(auto x : G[fr])
        {
            if(!viz[x])
            {
                viz[x] = viz[fr]+1;
                q.push(x);
            }
        }
    }
    for(int i=1;i<=n;++i)
        fout << viz[i]-1 << ' ';
}

int main()
{
    int i,s,x,y;
    fin >> n >> m >> s;
    for(i=1;i<=m;++i)
    {
        fin >> x >> y;
        if(find(G[x].begin(),G[x].end(),y) == G[x].end())
        {
            G[x].push_back(y);
        }
    }

    bfs(s);
    return 0;
}