N, K = gets.split.map(&:to_i)
S = gets.chomp

def try(s, l, r)
  ret = s.dup
  ret[l..r] = ret[l..r].reverse.tr("LR", "RL")
  ret
end

def count(s)
  ret = 0
  prev_c = nil
  for i in 0...s.length
    c = s[i]
    if c == prev_c
      ret += 1
    end
    prev_c = c
  end
  ret
end

def make_cands(s)
  ret = []
  l = 0; r = 1; x = 0
  loop do
    #p l: l, r: r, x: x, s: s, slr: s[l..r]
    break if r >= s.length
    if s[r] == s[l]
      r += 1
    else
      s_ = try(s, l, r-1)
      #p l: l, r: r, c: count(s_), slr: s[l..r-1]
      item = [count(s_), s_, l, r-1]
      ret << item

      if x < 1 && !(r-l == 1)
        s_ = try(s, l, r)
        #p l: l, r: r, c: count(s_), slr: s[l..r]
        item = [count(s_), s_, l, r]
        ret << item
      end
      if x == 1
        c = s[l]
        l += 1 while s[l] == c
        r = l + 1
        x = 0
      else
        r += 1
        x += 1
      end
    end
  end
  s_ = try(s, l, r-1)
  ret << [count(s_), s_, l, r-1]
  ret
end
  
s = S; c = nil
K.times do
  cands = make_cands(s)
  m = cands.map{|n, _, _, _| n}.max
  c, s, l, r = cands.select{|n, _, _, _| n == m}
                    .max_by{|n, _, l, r| r-l}
  #p c: c, s: s, l: l, r: r
end
p c