#include <bits/stdc++.h>
#pragma GCC optimize("O1")

using namespace std;

class InputReader
{
public:
    static const int BUFF_SIZE = 1 << 17;
    FILE *fin;
    int bp;
    char buff[BUFF_SIZE];
    InputReader (const char *file_name)
    {
        fin = fopen(file_name, "r");
        bp = BUFF_SIZE - 1;
    }
    void adv()
    {
        if (++bp == BUFF_SIZE)
        {
            fread(buff, sizeof(char), BUFF_SIZE, fin);
            bp = 0;
        }
    }
    InputReader& operator >> (int& num)
    {
        num = 0;
        while (isdigit(buff[bp]) == false)
            adv();
        while (isdigit(buff[bp]))
        {
            num = num * 10 + buff[bp] - '0';
            adv();
        }
        return *this;
    }
};

class ofbuffer
{
private:
    char* b_text;
    int b_capacity, b_size;
    FILE* file;

    inline void b_put_ch( char ch )
    {
        b_text[b_size ++] = ch;
        if ( b_size == b_capacity )
            b_flush();
    }

    void b_put_nr( int x )
    {
        if ( x > 0 )
        {
            b_put_nr( x / 10 );
            b_put_ch( '0' + x % 10 );
        }
    }

public:
    inline ofbuffer( char * path, int capacity = 16000 )
    {
        file = fopen( path, "w" );

        b_text = new char[capacity];
        b_capacity = capacity;
        b_size = 0;
    }

    inline ~ofbuffer()
    {
        if ( b_size != 0 )
            b_flush();
    }

    inline void b_flush( void )
    {
        fwrite( b_text, 1, b_size, file );
        b_size = 0;
    }

    inline ofbuffer &operator<<( int v )
    {
        if ( v == 0 )
            b_put_ch( '0' );
        else
            b_put_nr( v );
        return *this;
    }

    inline ofbuffer &operator<<( char v )
    {
        b_put_ch( v );
        return *this;
    }

    inline void close()
    {
        b_flush();
        fclose( file );
    }
};


InputReader fin("bfs.in");
ofbuffer fout("bfs.out");
ofstream f1("bfs.out");

vector < int > v[100005];
queue < int > q;

int viz[100005];

void bfs(int nod)
{
    int nd;
    q.push(nod);
    while (!q.empty())
    {
        nd = q.front();
        q.pop();
        for (auto &it : v[nd])
        {
            if (!viz[it])
            {
                q.push(it);
                viz[it] = viz[nd] + 1;
            }
        }
    }
}

int main()
{
    int n, m, nod, i, x, y;

    fin >> n >> m >> nod;

    for (i = 1; i <= m; ++i)
    {
        fin >> x >> y;
        v[x].emplace_back(y);
    }


    viz[nod] = 1;
    bfs(nod);

    for (i = 1; i <= n; ++i)
    {
        if (i == nod) fout << 0 << ' ';
        else if (viz[i]) fout << viz[i] - 1 << ' ';
        else fout << '-' << 1 << ' ';
    }

    return 0;
}