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

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

#define NMAX 100010

vector<int> v[NMAX];
int n,m;
int d[NMAX];

void bfs(int s)
{
    for(int i=1; i<=n; i++)
        d[i]=-1;
    queue<int> q;
    q.push(s);
    d[s]=0;
    while(!q.empty())
    {
        int c = q.front();
        q.pop();
        for(auto it : v[c])
            if(d[it]==-1)
            {
                q.push(it);
                d[it]=d[c]+1;
            }
    }
}

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

    bfs(s);

    for(i=1; i<=n; i++)
        fout<<d[i]<<' ';
    return 0;
}