A. Hello, SCNUCPC!
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Eight thousand years later, all humans and AIs in the world are playing SCNUCPC in "Tsukuyomi".

There is a street in "Tsukuyomi" called "Magic Street". Yachiyo needs to arrange Magic Street to welcome this year's SCNUCPC. There are $$$n$$$ stalls on Magic Street. The type of each stall can be represented by an uppercase letter in A $$$\sim$$$ Z.

At first, some stalls are already set to type C, and all other stalls are unset, marked as ?. Yachiyo wants to set all unset stalls! The initial state of the stalls is represented by a string of length $$$n$$$, containing only C and ?.

Let string $$$s$$$ denote the state of the stalls after the arrangement. If $$$s_is_{i+1} \dots s_{i+5}s_{i+6}=$$$ SCNUCPC, then $$$i$$$ is called a venue. Your task is to give an arrangement $$$s$$$ such that there are exactly $$$k$$$ venues on Magic Street, or report that there is no solution.

If there are multiple valid answers, output any of them.

Input

Each test file contains multiple test cases. The first line contains an integer $$$T$$$ $$$(1 \leq T \leq 10^3)$$$, the number of test cases.

For each test case, the first line contains two integers $$$n,k$$$ $$$(0 \leq k \lt n \leq 2 \times 10^5)$$$, the number of stalls and the number of venues.

The next line contains a string of length $$$n$$$, containing only C and ?, representing the initial state of the stalls on Magic Street.

It is guaranteed that the sum of $$$n$$$ over all test cases does not exceed $$$2 \times 10^5$$$.

Output

For each test case, if there is no solution, output one line containing No;

Otherwise, output one line containing Yes, then output a string of length $$$n$$$ representing the arrangement $$$s$$$.

Example
Input
2
7 1
????C??
16 2
??C?C??C??C??C?C
Output
Yes
SCNUCPC
No