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
134
135
136
137
138
139
140
141
142
143
144
145
146
147
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class mis {


    public static V[] g;
    public static int d;

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int m = in.nextInt();
        d = in.nextInt();
//        String line = in.nextLine();
//        String[] arr = line.split(" ");
//        int[] a = toIntArr(arr);

//        int[] a = new int[m];
//        int[] b = new int[m];
//        for(int i=0; i<m; i++) {
//            a[i] = in.nextInt();
//            b[i] = in.nextInt();
//        }


        g = new V[n];
        for(int i=0; i<n; i++) {
            g[i] = new V(i);
        }
        for(int i=0; i<m; i++) {
            Integer a = in.nextInt()-1;
            Integer b = in.nextInt()-1;
            g[a].e.add(b);
            g[b].e.add(a);
        }

        solve();
    }

//    private static int[] toIntArr(String[] sArr) {
//        int[] iArr = new int[sArr.length];
//        for (int i = 0; i < sArr.length; i++) {
//            iArr[i] = Integer.parseInt(sArr[i]);
//        }
//        return iArr;
//    }

    public static void solve() {

//        for(List<Integer> v: g) {
//            System.out.println(v);
//            d[]
//        }

        Set<V> toProcess = new HashSet<V>();
        for(int i=0; i<g.length; i++) {
            toProcess.add(g[i]);
        }

        //for(int i=0; i<g.length; i++) {
        //for(V v: toProcess) {
        while(! toProcess.isEmpty()){
            V v = toProcess.iterator().next();
            toProcess.remove(v);
            //System.out.println("p: " + v.n);
            if(v.e.size() < d) {
                v.removed = true;
                //System.out.println("r: " + v.n);
                for(Integer num2: v.e) {
                    //System.out.println(num2);
                    V v2 = g[num2];
                    if(! v2.removed) {
                        v2.e.remove(v.n);
                        toProcess.add(v2);
                    }
                }
            }
        }

//        for(int i=0; i<g.length; i++) {
//            System.out.println(i + ": " + g[i].removed + ", " + g[i].e);
//        }

        boolean empty = true;
        for(int i=0; i<g.length; i++) {
            if(! g[i].removed) {
                empty = false;
                break;
            }
        }
        if(empty) {
            System.out.println("NIE");
            return;
        }

        int tree = 0;
        int max = 0;
        int maxTree = 0;
        for(int i=0; i<g.length; i++) {
            if (!g[i].removed && g[i].treeNum == 0) {
                tree++;
                int s = dfs(i, tree);
                if(max < s) {
                    max = s;
                    maxTree = tree;
                }
            }
        }
        //System.out.println("t: " + tree);
        System.out.println(max);

        for(int i=0; i<g.length; i++) {
            if(g[i].treeNum == maxTree) {
                System.out.print((i+1) + " ");
            }
        }
        System.out.println();

    }

    public static int dfs(int i, int tree) {
        V v = g[i];
        int s = 0;
        if(! v.removed && v.treeNum == 0) {
            v.treeNum = tree;
            s = 1;
            for(Integer num2: v.e) {
                s += dfs(num2, tree);
            }
        }
        return s;
    }
}


class V {
    public V(int n) {
        this.n = n;
    }
    Integer n;
    ArrayList<Integer> e = new ArrayList<Integer>();
    boolean removed = false;
    int treeNum = 0;
}