B'You like playing chess tournaments online. In your last tournament you played n games. For the sake of this problem, each chess game is either won or lost (no draws). When you lose a game you get 0 points. When you win you get 1 or 2 points: if you have won also the previous game you get 2 points, otherwise you get 1 point. If you win the very first game of the tournament you get 1 point (since there is not a "previous game"). The outcomes of the n games are represented by a string s of length n : the i -th character of s is W if you have won the i -th game, while it is L if you have lost the i -th game. After the tournament, you notice a bug on the website that allows you to change the outcome of at most k of your games (meaning that at most k times you can change some symbol L to W, or W to L). Since your only goal is to improve your chess rating, you decide to cheat and use the bug. Compute the maximum score you can get by cheating in the optimal way. Each test contains multiple test cases. The first line contains an integer t ( 1 <= t <= 20,000 ) -- the number of test cases. The description of the test cases follows. The first line of each testcase contains two integers n, k ( 1 <= n <= 100,000 , 0 <= k <= n ) xe2 x80 x93 the number of games played and the number of outcomes that you can change. The second line contains a string s of length n containing only the characters W and L. If you have won the i -th game then s_i= , W, if you have lost the i -th game then s_i= , L. It is guaranteed that the sum of n over all testcases does not exceed 200,000 . For each testcase, print a single integer xe2 x80 x93 the maximum score you can get by cheating in the optimal way. Explanation of the first testcase. Before changing any outcome, the score is 2 . Indeed, you won the first game, so you got 1 point, an'...