CF299B.Ksusha the Squirrel

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)?

松鼠库舒莎站在一条笔直道路的起点，该道路被划分为 $n$ 个区域。这些区域从左到右编号为 $1$ 到 $n$。初始时，库舒莎位于第 $1$ 个区域。

库舒莎希望走到道路尽头，即到达第 $n$ 个区域。不幸的是，道路上存在一些石头。已知库舒莎讨厌石头，因此她不愿停留在有石头的区域中。

库舒莎这只好动的松鼠保持着良好的体能。她可以从第 $i$ 个区域跳跃至任意一个区域：$i+1,\,i+2,\,\dots,\,i+k$。

请帮助库舒莎！给定道路的描述，请判断她能否到达道路尽头（注意：她不能停留在有石头的区域上）？

The first line contains two integers n and k (2 ≤ n ≤ 3·105, 1 ≤ k ≤ 3·105). 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 ".".

第一行包含两个整数 $n$ 和 $k$（$2 \leq n \leq 3\cdot10^5$，$1 \leq k \leq 3\cdot10^5$）。下一行包含 $n$ 个字符 —— 描述道路：若第 $i$ 个路段没有岩石，则第 $i$ 个字符为 .；否则为 #。

保证第一个和最后一个字符均为 .。

Print "YES" (without the quotes) if Ksusha can reach the end of the road, otherwise print "NO" (without the quotes).

如果库舒沙能够到达道路的终点，则输出 "YES"（不带引号），否则输出 "NO"（不带引号）。