n, m, k = map(int, raw_input().split())
e = [[] for _ in xrange(n + 1)]
for i in xrange(m):
x, y = map(int, raw_input().split())
e[x].append(y)
e[y].append(x)
curr = 1
chain =[]
inchain = [0]*(n+1)
while True:
if inchain[curr] == 1:
break
chain.append(curr)
inchain[curr] = 1
for i in e[curr]:
if inchain[i] == 0:
curr = i
break
minindex = min(map(chain.index,e[curr]))
print len(chain) - minindex
print ' '.join(map(str,chain[minindex:]))