output_description: If we can choose K integers as above, print `YES`; otherwise, print `NO`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N K
attempt: def solution(edges):
      num_of_neighbor = {}
      for e in edges:
          if e[0] in num_of_neighbor:
              num_of_neighbor[e[0]] += 1
          else:
              num_of_neighbor[e[0]] = 1
          if e[1] in num_of_neighbor:
              num_of_neighbor[e[1]] += 1
          else:
              num_of_neighbor[e[1]] = 1
      n_2 = 0
      n_1 = 0
      for n in num_of_neighbor:
          if num_of_neighbor[n] == 2:
              n_2 += 1
          elif num_of_neighbor[n] == 1:
              n_1 += 1
  
          if n_2 == 2 and n_1 == 2:
              return "YES"
          else:
              return "NO"
  
  
  e1 = [int(s) for s in input().split(" ")]
  e2 = [int(s) for s in input().split(" ")]
  e3 = [int(s) for s in input().split(" ")]
  edges = [e1, e2, e3]
  print(solution(edges))
  
problem_description: Statement
  
  Determine if we can choose K different integers between 1 and N (inclusive) so
  that no two of them differ by 1.
samples: [{"input": "3 2", "output": "YES\n    \n\nWe can choose 1 and 3.\n\n* * *"}, {"input": "5 5", "output": "NO\n    \n\n* * *"}, {"input": "31 10", "output": "YES\n    \n\n* * *"}, {"input": "10 90", "output": "NO"}]