1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
#include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>

#define e1 first
#define e2 second

using namespace std;

int n;
int load[524288];
int vert[524288];
bool av[200010];
int pot;

void set(int x, int v)
{
    load[x + pot - 1] += v;
    x += pot - 1;
    while (x > 1)
    {
        x /= 2;
        if (load[2*x] < load[2*x+1])
        {
            load[x] = load[2*x];
            vert[x] = vert[2*x];
        }
        else
        {
            load[x] = load[2*x+1];
            vert[x] = vert[2*x+1];
        }
    }
}

int main()
{
    int n, m, d;
    scanf("%d%d%d", &n, &m, &d);
    pot = 1;
    while (pot < n) pot *= 2;

    vector<int>* graf = new vector<int>[n + 1];

    for (int i = 1; i <= n; i++)
    {
        av[i] = true;
        vert[i + pot - 1] = i;
    }

    for (int i = 1; i < pot; i++)
    {
        load[i] = 123456789;
    }
    for (int i = pot + n; i < pot*2; i++)
    {
        load[i] = 123456789;
    }

    for (int i = 0; i < m; i++)
    {
        int a, b;
        scanf("%d%d", &a, &b);

        graf[a].push_back(b);
        graf[b].push_back(a);

        set(a, 1);
        set(b, 1);
    }

    while (load[1] < d)
    {
        int v = vert[1];

        av[v] = false;
        set(v, 123456789);
        for (int i = 0; i < graf[v].size(); i++)
            if (av[graf[v][i]])
        {
            set(graf[v][i], -1);
        }
    }

    int maxwyn = 0;
    vector<int> maxgraf;

    for (int i = 1; i <= n; i++)
    {
        if (av[i])
        {
            int wyn = 0;
            vector<int> maxgraf2;
            queue<int> q;
            q.push(i);
            av[i] = false;
            while (!q.empty())
            {
                int v = q.front();
                q.pop();
                    wyn++;
                    maxgraf2.push_back(v);

                for (int j = 0; j < graf[v].size(); j++)
                    if (av[graf[v][j]])
                {
                    av[graf[v][j]] = false;
                    q.push(graf[v][j]);
                }
            }

            if (wyn > maxwyn)
            {
                maxwyn = wyn;
                maxgraf.clear();
                for (int j = 0; j < maxgraf2.size(); j++)
                    maxgraf.push_back(maxgraf2[j]);
            }
        }
    }

    sort(maxgraf.begin(), maxgraf.end());

    if (maxwyn == 0)
        printf("NIE");
    else
    {
        printf("%d\n", maxwyn);
        for (int i = 0; i < maxgraf.size(); i++)
            printf("%d ", maxgraf[i]);
    }
}