Question 68

[Mahi1901]

A string is said to be using strong language if it contains at least KK consecutive characters '*'.

You are given a string SS with length NN. Determine whether it uses strong language or not.

Input The first line of the input contains a single integer TT denoting the number of test cases. The description of TT test cases follows. The first line of each test case contains two space-separated integers NN and KK. The second line contains a single string SS with length NN. Output Print a single line containing the string "YES" if the string contains strong language or "NO" if it does not (without quotes).

Constraints 1≤T≤10 1≤K≤N≤10^6 SS contains only lowercase English letters and characters '*' Sum of NN over all testcases is at most 10^6.

Sample 1: Input 3 5 2 ab 5 2 a**b 5 1 abcde Output NO YES NO

[ghost]

Jalpaiguri Government Engineering College 2nd year, Information Technology Department Can you kindly assign this issue to me?

[pranotip283]

Pranoti Patil CCOEW COMP can you assign me this issue?

[ManasiGDeshmukh]

Manasi Deshmukh Cummins college of engineering for women, Pune Computer Engineering I would like to work on this issue. Can you please assign me this issue?

[ShrutikaK2911]

Name : Shrutika Kaperavenollu CCOEW Branch : IT I would like to work on this issue. Can you please assign me this issue

[NikitaMiraje]

Nikita Miraje Cummins college of engineering for women Dept: Electronics and telecommunication I would like to work on this issue. Can you please assign me this issue?

[ArtiHere]

Name : Arti Tambade College : CCOEW Branch : IT I would like to work on this issue. Can you please assign me this issue

[Mahi1901]

I have assigned. Happy coding!