import io
import sys
from collections import defaultdict, deque, Counter
from itertools import permutations, combinations, accumulate
from heapq import heappush, heappop
from bisect import bisect_right, bisect_left
from math import gcd
import math

_INPUT = """\
6
8 3
1 3 5 6 4 8 9 10
10 10
1 2 3 2 3 2 3 2 1 1
10 5
199178881 932079191 906976560 427573994 961937646 979063146 995030172 852645442 662699738 313858222
"""

def input():
  return sys.stdin.readline()[:-1]

def solve(test):
  N,K=map(int,input().split())
  A=list(map(int,input().split()))
  B=sorted([(A[i],i) for i in range(N)])
  C=sorted([(B[i][1],0 if i<K else 1) for i in range(N)])
  ans=[]
  for i in range(1,N):
    if C[i][1]==1 and C[i-1][1]==0:
      ans.append(C[i][0]+1)
  print(len(ans))
  print(*ans)

def random_input():
  from random import randint,shuffle
  N=randint(1,10)
  M=randint(1,N)
  A=list(range(1,M+1))+[randint(1,M) for _ in range(N-M)]
  shuffle(A)
  return (" ".join(map(str, [N,M]))+"\n"+" ".join(map(str, A))+"\n")*3

def simple_solve():
  return []

def main(test):
  if test==0:
    solve(0)
  elif test==1:
    sys.stdin = io.StringIO(_INPUT)
    case_no=int(input())
    for _ in range(case_no):
      solve(0)
  else:
    for i in range(1000):
      sys.stdin = io.StringIO(random_input())
      x=solve(1)
      y=simple_solve()
      if x!=y:
        print(i,x,y)
        print(*[line for line in sys.stdin],sep='')
        break

#0:提出用、1:与えられたテスト用、2:ストレステスト用
main(0)