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 <bits/stdc++.h>
using namespace std;

int n, m;
int d;

int p1, p2;
vector <int> graf[1000007];

int licz[1000007];
int co[1000007];

int wyw[1000007];

int n1;

pair <int,int> drzewo[1100007];

int x;

int l;
int bylo[1000007];
vector <int> wek[1000007];

int potenga(int v)
{
    for (int i=1; 1; i<<=1)
    {
        if (i>=v)
        {
            return i;
        }
    }
}

void start(int v, int a, int b)
{
    if (a==b)
    {
        drzewo[v]=make_pair(licz[co[a]], co[a]);
        return;
    }
    start((v<<1), a, (a+b)>>1);
    start((v<<1)^1, (a+b+2)>>1, b);
    drzewo[v]=min(drzewo[(v<<1)], drzewo[(v<<1)^1]);
}

void pisz(int v, int war)
{
    v+=n1-1;
    drzewo[v].first+=war;
    v>>=1;
    while(v)
    {
        drzewo[v]=min(drzewo[(v<<1)], drzewo[(v<<1)^1]);
        v>>=1;
    }
}

void dfs(int v)
{
    bylo[v]=1;
    wek[l].push_back(v);
    for (int i=0; i<graf[v].size(); i++)
    {
        if (!bylo[graf[v][i]] && !wyw[graf[v][i]])
        {
            dfs(graf[v][i]);
        }
    }
}

int main()
{
    scanf("%d%d%d", &n, &m, &d);
    n1=potenga(n+2);
    licz[0]=1000000000;
    for (int i=1; i<=m; i++)
    {
        scanf("%d%d", &p1, &p2);
        graf[p1].push_back(p2);
        graf[p2].push_back(p1);
        licz[p1]++;
        licz[p2]++;
    }
    for (int i=1; i<=n; i++)
    {
        co[i]=i;
    }
    start(1, 1, n1);
    for (int i=1; i<=n; i++)
    {
        if (drzewo[1].first<d)
        {
            x=drzewo[1].second;
            wyw[x]=1;
            pisz(x, 1000000000);
            for (int j=0; j<graf[x].size(); j++)
            {
                pisz(graf[x][j], -1);
            }
            continue;
        }
        for (int j=1; j<=n; j++)
        {
            if (!bylo[j] && !wyw[j])
            {
                l++;
                dfs(j);
            }
        }
        x=0;
        for (int j=1; j<=l; j++)
        {
            x=max(x, (int) wek[j].size());
        }
        for (int j=1; j<=l; j++)
        {
            if (x==wek[j].size())
            {
                sort(wek[j].begin(), wek[j].end());
                printf("%d\n", (int) wek[j].size());
                for (int k=0; k<wek[j].size(); k++)
                {
                    printf("%d ", wek[j][k]);
                }
                return 0;
            }
        }
    }
    printf("NIE\n");
    return 0;
}