output_description: If Takahashi's submission gets an AC, print `Yes`; otherwise, print `No`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N M
attempt: # 立っているビットの数をO(1)で勘定
  def popcnt(n):
      c = (n & 0x5555555555555555) + ((n >> 1) & 0x5555555555555555)
      c = (c & 0x3333333333333333) + ((c >> 2) & 0x3333333333333333)
      c = (c & 0x0F0F0F0F0F0F0F0F) + ((c >> 4) & 0x0F0F0F0F0F0F0F0F)
      c = (c & 0x00FF00FF00FF00FF) + ((c >> 8) & 0x00FF00FF00FF00FF)
      c = (c & 0x0000FFFF0000FFFF) + ((c >> 16) & 0x0000FFFF0000FFFF)
      c = (c & 0x00000000FFFFFFFF) + ((c >> 32) & 0x00000000FFFFFFFF)
      return c
  
  
  # print((103, bin(103)[2:], popcnt(103)))
  # 出力
  # (103, '1100111', 5)
  
problem_description: Statement
  
  Takahashi is participating in a programming contest, AXC001. He has just
  submitted his code to Problem A.  
  The problem has N test cases, all of which must be passed to get an AC
  verdict.  
  Takahashi's submission has passed M cases out of the N test cases.  
  Determine whether Takahashi's submission gets an AC.
samples: [{"input": "3 3", "output": "Yes\n    \n\nAll three test cases have been passed, so his submission gets an AC.\n\n* * *"}, {"input": "3 2", "output": "No\n    \n\nOnly two out of the three test cases have been passed, so his submission does\nnot get an AC.\n\n* * *"}, {"input": "1 1", "output": "Yes"}]