output_description: If Takahashi will reach the place in time, print `Yes`; otherwise, print `No`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      D T S
attempt: n, m = map(int, input().split())
  li = []
  ans = 0
  if m != 0:
      for i in range(m):
          a, b = map(int, input().split())
          if len(li) == 0:
              li.append([a, b])
          else:
              flag = 0
              for j in range(len(li)):
                  if a in li[j] and b not in li[j]:
                      li[j].append(b)
                      flag = 1
                  elif a not in li[j] and b in li[j]:
                      li[j].append(a)
                      flag = 1
                  elif a in li[j] and b in li[j]:
                      break
                  elif flag == 0 and j == len(li) - 1:
                      li.append([a, b])
          # print(li)
      ans = max([len(li[i]) for i in range(len(li))])
  print(ans if m != 0 else 1)
  
problem_description: Statement
  
  Takahashi is meeting up with Aoki.
  
  They have planned to meet at a place that is D meters away from Takahashi's
  house in T minutes from now.
  
  Takahashi will leave his house now and go straight to the place at a speed of
  S meters per minute.
  
  Will he arrive in time?
samples: [{"input": "1000 15 80", "output": "Yes\n    \n\nIt takes 12.5 minutes to go 1000 meters to the place at a speed of 80 meters\nper minute. They have planned to meet in 15 minutes so he will arrive in time.\n\n* * *"}, {"input": "2000 20 100", "output": "Yes\n    \n\nIt takes 20 minutes to go 2000 meters to the place at a speed of 100 meters\nper minute. They have planned to meet in 20 minutes so he will arrive just on\ntime.\n\n* * *"}, {"input": "10000 1 1", "output": "No\n    \n\nHe will be late."}]