Ksusha the Squirrel is standing at the beginning of a straight road, divided into *n* sectors. The sectors are numbered 1 to *n*, from left to right. Initially, Ksusha stands in sector 1. 

Ksusha wants to walk to the end of the road, that is, get to sector *n*. Unfortunately, there are some rocks on the road. We know that Ksusha hates rocks, so she doesn't want to stand in sectors that have rocks.

Ksusha the squirrel keeps fit. She can jump from sector *i* to any of the sectors *i* + 1, *i* + 2, ..., *i* + *k*. 

Help Ksusha! Given the road description, say if she can reach the end of the road (note, she cannot stand on a rock)?
The first line contains two integers *n* and *k* (2 ≤ *n* ≤ 3·10<sup class="upper-index">5</sup>, 1 ≤ *k* ≤ 3·10<sup class="upper-index">5</sup>). The next line contains *n* characters — the description of the road: the *i*-th character equals ".", if the *i*-th sector contains no rocks. Otherwise, it equals "#".

It is guaranteed that the first and the last characters equal ".".
def can_reach_end(road, k):
  """
  Determines if Ksusha can reach the end of the road.

  Args:
    road: A list of characters representing the road.
    k: The maximum jump length.

  Returns:
    True if Ksusha can reach the end of the road, False otherwise.
  """

  # Initialize a visited array.
  visited = [False] * len(road)

  # Create a queue to store the indexes that Ksusha can reach.
  queue = []
  queue.append(0)

  # Iterate through the queue until it is empty.
  while queue:
    i = queue.pop(0)

    if i == len(road) - 1:
      return True

    for j in range(1, k + 1):
      if road[i + j] != '#' and not visited[i + j]:
        visited[i + j] = True
        queue.append(i + j)

  return False


n, k = input().split()
n, k = int(n), int(k)
road = input()

if can_reach_end(road, k):
    print("YES")
else:
    print("NO")
