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

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

int n,m,s;

vector<int> V[100002];
int ap[100002];
int bfs(int x)
{
    queue<int> Q;
    Q.push(x);
    ap[x]=1;
    while(!Q.empty())
    {
        int p = Q.front();
        for(auto it = V[p].begin(); it != V[p].end(); ++it)
            if(ap[*it]==0)
            {
                ap[*it]=ap[p]+1;
                Q.push(*it);
            }
        Q.pop();
    }
    for(int i=1;i<=n;i++)
        fout<<ap[i]-1<<" ";
}

int main()
{
    fin>>n>>m>>s;
    int x,y;
    for(int i=0;i<m;i++)
    {
        fin>>x>>y;
        V[x].push_back(y);
    }
    bfs(s);
    return 0;
}