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

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

const int nmax = 100001;
vector<int>g[nmax];
queue<int>q;
int dist[nmax];

void bfs(int start)
{
    dist[start] = 1;
    q.push(start);
    while(!q.empty())
    {
        int varf = q.front();
        for(int i = 0; i < g[varf].size(); i++)///parcurg vecinii lui varf
        {
            int curr = g[varf][i];
            if(dist[curr] == 0)
            {
                dist[curr] = dist[varf] + 1;
                q.push(curr);///nu uita sa adaugi in coada elem vecin!
            }
        }
        q.pop();
    }
}
int main()
{
    int n,m,start;
    in>>n>>m>>start;
    for(int i = 1; i <= m ; i++)
    {
        int x,y;
        in>>x>>y;
        g[x].push_back(y);
    }
    bfs(start);
    for(int i = 1; i <= n; i++)
    {
        out<<dist[i] - 1<<' '; ///consider dist de la s la s initializata cu 1(ca sa pot afisa pt nodurile din alte comp conexe -1)
    }
    return 0;
}