Each evening Roma plays online poker on his favourite website. The rules of poker on this website are a bit strange: there are always two players in a hand, there are no bets, and the winner takes 1 virtual bourle from the loser.

Last evening Roma started to play poker. He decided to spend no more than k virtual bourles — he will stop immediately if the number of his loses exceeds the number of his wins by k. Also Roma will leave the game if he wins enough money for the evening, i.e. if the number of wins exceeds the number of loses by k.

Next morning Roma found a piece of paper with a sequence on it representing his results. Roma doesn't remember the results exactly, and some characters in the sequence are written in a way such that it's impossible to recognize this character, so Roma can't recall whether he won k bourles or he lost.

The sequence written by Roma is a string s consisting of characters W (Roma won the corresponding hand), L (Roma lost), D (draw) and ? (unknown result). Roma wants to restore any valid sequence by changing all ? characters to W, L or D. The sequence is called valid if all these conditions are met: 

  * In the end the absolute difference between the number of wins and loses is equal to k; 
  * There is no hand such that the absolute difference before this hand was equal to k. 



Help Roma to restore any such sequence.

Input

The first line contains two numbers n (the length of Roma's sequence) and k (1 ≤ n, k ≤ 1000).

The second line contains the sequence s consisting of characters W, L, D and ?. There are exactly n characters in this sequence.

Output

If there is no valid sequence that can be obtained from s by replacing all ? characters by W, L or D, print NO.

Otherwise print this sequence. If there are multiple answers, print any of them.

Examples

Input

3 2
L??


Output

LDL


Input

3 1
W??


Output

NO


Input

20 5
?LLLLLWWWWW?????????


Output

WLLLLLWWWWWWWWLWLWDW
import java.util.*;
import java.io.*;
//import java.text.*;

public class Main{
    final long MOD = (long)1e9+7, IINF = (long)1e19;
    final int MAX = (int)1e5+1, MX = (int)1e7+1, INF = (int)1e9;
//    DecimalFormat df = new DecimalFormat("0.00000000");
    final double EPS = 1e-8;
    FastReader in;
    PrintWriter out;
    boolean multipleTC = false;

    public static void main(String[] args) throws Exception{new Main().run();};
    void run() throws Exception{
        in = new FastReader();
        out = new PrintWriter(System.out);
        for(int i = 1, t = (multipleTC)?ni():1; i<=t; i++)solve(i);
        out.flush();    
        out.close();
    }
    
    void solve(int TC){
        int n = ni(), k = ni();
        String s = " "+n();
        int[] a = new int[n+1];
        for(int i = 1; i<= n; i++){
            if(s.charAt(i) == 'L')a[i] = 0;
            else if(s.charAt(i)=='W')a[i] = 2;
            else if(s.charAt(i) == 'D')a[i] = 1;
            else a[i] = 3;
        }
        boolean[][] dp = new boolean[n+2][k*2+1];
        dp[0][0+k] = true;
        for(int i = 1; i< n; i++){
            if(a[i]==3){
                for(int j = 1; j< 2*k; j++){
                    dp[i][j] |= dp[i-1][j];
                    dp[i][j] |= dp[i-1][j-1];
                    dp[i][j] |= dp[i-1][j+1];
                }
            }else{
                int v = 1-a[i];
                for(int j = 1; j< 2*k; j++){
                    dp[i][j] |= dp[i-1][j+v];
                }   
            }
        }
        char[] ans = new char[n+1];
        if(a[n] == 1)pn("NO");
        else if((a[n] == 2 || a[n] == 3) && dp[n-1][2*k-1]){
            ans[n] = 'W';
            int cur = 2*k-1;
            for(int i = n-1; i>=1; i--){
                if(a[i]==0){
                    ans[i] = 'L';
                    cur++;
                }
                else if(a[i]==1)ans[i] = 'D';
                else if(a[i]==2){
                    ans[i] = 'W';
                    cur--;
                }
                else{
                    if(dp[i-1][cur]){
                        ans[i] = 'D';
                    }else if(cur>0 && dp[i-1][cur-1]){
                        ans[i] = 'W';
                        cur--;
                    }else if(cur<2*k && dp[i-1][cur+1]){
                        ans[i] = 'L';
                        cur++;
                    }
                }
            }
            for(int j = 1; j<= n; j++)p(ans[j]);
        }else if((a[n] == 0 || a[n] == 3) && dp[n-1][1]){
            ans[n] = 'L';
            int cur = 1;
            for(int i = n-1; i>=1; i--){
                if(a[i]==0){
                    ans[i] = 'L';
                    cur++;
                }
                else if(a[i]==1)ans[i] = 'D';
                else if(a[i]==2){
                    ans[i] = 'W';
                    cur--;
                }
                else{
                    if(dp[i-1][cur]){
                        ans[i] = 'D';
                    }else if(cur>0 && dp[i-1][cur-1]){
                        ans[i] = 'W';
                        cur--;
                    }else if(cur<2*k && dp[i-1][cur+1]){
                        ans[i] = 'L';
                        cur++;
                    }
                }
            }
            for(int j = 1; j<= n; j++)p(ans[j]);
        }else pn("NO");
    }
    
    long sum(long n){
        return (n*(n+1))/2;
    }
    
    long modPow(long a, long p){
        long o = 1;
        while(p>0){
            if(p%2==1)o = mul(o,a);
            a = mul(a,a);
            p>>=1;
        }
        return o;
    }

    long mul(long a, long b){
        if(IINF/a < b)return IINF;
        return a*b;
    }

    int[] reverse(int[] a){
        int[] o = new int[a.length];
        for(int i = 0; i< a.length; i++)o[i] = a[a.length-i-1];
        return o;   
    }

    int[] sort(int[] a){
        if(a.length==1)return a;
        int mid = a.length/2;
        int[] b = sort(Arrays.copyOfRange(a,0,mid)), c = sort(Arrays.copyOfRange(a,mid,a.length));
        for(int i = 0, j = 0, k = 0; i< a.length; i++){
            if(j<b.length && k<c.length){
                if(b[j]<c[k])a[i] = b[j++];
                else a[i] = c[k++];
            }else if(j<b.length)a[i] = b[j++];
            else a[i] = c[k++];
        }
        return a;
    }

    long[] sort(long[] a){
        if(a.length==1)return a;
        int mid = a.length/2;
        long[] b = sort(Arrays.copyOfRange(a,0,mid)), c = sort(Arrays.copyOfRange(a,mid,a.length));
        for(int i = 0, j = 0, k = 0; i< a.length; i++){
            if(j<b.length && k<c.length){
                if(b[j]<c[k])a[i] = b[j++];
                else a[i] = c[k++];
            }else if(j<b.length)a[i] = b[j++];
            else a[i] = c[k++];
        }
        return a;
    }

    int[] ia(int ind,int n){
        int[] out = new int[ind+n];
        for(int i = 0; i< n; i++)out[ind+i] = ni();
        return out;
    }

    long[] la(int ind, int n){
        long[] out = new long[ind+n];
        for(int i = 0; i< n; i++)out[ind+i] = nl();
        return out;
    }

    long gcd(long a, long b){return (b==0)?a:gcd(b,a%b);}
    int gcd(int a, int b){return (b==0)?a:gcd(b,a%b);}
    int bitcount(long n){return (n==0)?0:(1+bitcount(n&(n-1)));}
    void p(Object o){out.print(o);}
    void pn(Object o){out.println(o);}
    void pni(Object o){out.println(o);out.flush();}
    String n(){return in.next();}
    String nln(){return in.nextLine();}
    int ni(){return Integer.parseInt(in.next());}
    long nl(){return Long.parseLong(in.next());}
    double nd(){return Double.parseDouble(in.next());}

    class FastReader{
        BufferedReader br;
        StringTokenizer st;
        public FastReader(){
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        public FastReader(String s) throws Exception{
            br = new BufferedReader(new FileReader(s));
        }

        String next(){
            while (st == null || !st.hasMoreElements()){
                try{
                    st = new StringTokenizer(br.readLine());
                }catch (IOException  e){
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        String nextLine(){
            String str = "";
            try{
                str = br.readLine();
            }catch (IOException e){
                e.printStackTrace();
            }
            return str;
        }
    }
}