#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");
const int N = 100005;
vector <int>v[N];
int cat[N];
int n,m;
void bfs(int start)
{
    for(int i = 1; i <= n; i++)
        cat[i] = -1;
    queue <int> q;
    q.push(start);
    cat[start] = 0;
    while(!q.empty())
    {
        int nou = q.front();
        q.pop();
        for(int i = 0; i < v[nou].size(); i++)
        {
            int s = v[nou][i];
            if(cat[s] == -1)
            {
                cat[s] = cat[nou] + 1;
                q.push(s);
            }
        }
    }
}
int main()
{
    int x,y,cnt = 0,i,start;
    cin >> n >> m >> start;
    for(i = 1; i <= m; i++)
    {
        cin >> x >> y;
        v[x].push_back(y);
    }
    bfs(start);
    for(i = 1; i <= n; i++)
    {
        cout << cat[i] << " ";
    }
    return 0;
}