output_description: Print the (X/2)-th (rounded up to the nearest integer) lexicographically
  smallest sequence listed in FEIS, with spaces in between, where X is the total
  number of sequences listed in FEIS.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      K N
attempt: N, K = map(int, input().split())
  # 1 2 3...N
  if N % 2 == 0:
      L = [str(N)] * K
      L[0] = str(N // 2)
      print(" ".join(L))
      exit()
  # L[0]=N//2+1
  # N//2のずれ？
  L = [(N // 2) + 1] * K
  for i in range(K // 2):
      if L[-1] == 1:
          L.pop(-1)
      elif len(L) != K:
          L[-1] -= 1
          L += [N] * (K - len(L))
      else:
          L[-1] -= 1
  L = list(map(str, L))
  print(" ".join(L))
  
problem_description: Statement
  
  In Finite Encyclopedia of Integer Sequences (FEIS), all integer sequences of
  lengths between 1 and N (inclusive) consisting of integers between 1 and K
  (inclusive) are listed.
  
  Let the total number of sequences listed in FEIS be X. Among those sequences,
  find the (X/2)-th (rounded up to the nearest integer) lexicographically
  smallest one.
samples: [{"input": "3 2", "output": "2 1 \n    \n\nThere are 12 sequences listed in FEIS:\n(1),(1,1),(1,2),(1,3),(2),(2,1),(2,2),(2,3),(3),(3,1),(3,2),(3,3). The (12/2 =\n6)-th lexicographically smallest one among them is (2,1).\n\n* * *"}, {"input": "2 4", "output": "1 2 2 2\n    \n\n* * *"}, {"input": "5 14", "output": "3 3 3 3 3 3 3 3 3 3 3 3 2 2"}]