#include <fstream>
#include <vector>
#include <queue>
#define NMAX 100005
using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");
void bfs(int s);

vector<int>g[NMAX];
queue<int>q;
int n,m,s,i,a,b,rez[NMAX];
int main()
{

    cin >> n >> m >> s;
    for(i=1; i<=m; i++)
    {
        cin >> a >> b;
        g[a].push_back(b);
    }
    for(i=1; i<=n; i++)
        rez[i]=-1;
         rez[s]=0;
    bfs(s);

    for(i = 1; i <= n; i++)
        cout << rez[i] << " ";

    return 0;
}

void bfs(int s)
{
    int z;
    bool uz[NMAX]={0};
    q.push(s);
    uz[s] = 1;
    while(!q.empty())
    {
        z = q.front();
        q.pop();
        for(i=0; i< g[z].size(); i++)
        {
            if(uz[g[z][i]] == 0)
            {
                uz[g[z][i]] = 1;
                rez[g[z][i]] = rez[z]+1;
                q.push(g[z][i]);
            }
        }
    }
}