#include <bits/stdc++.h>
using namespace std;
deque<char>dq;
int main(){
    long long n,x;
    cin>>n>>x;
    string s;
    cin>>s;
    for(long long i=0;i<n;i++){
        if(s[i]=='U'&&dq.size()){
            dq.pop_back();
            continue;
        }
        dq.push_back(s[i]);
    }
    while(dq.size()){
        if(dq.front()=='U'){
            if(x==1){
                continue;
            }else{
                if(x%2==1){
                    x--;
                    x/=2;
                }else{
                    x/=2;
                }
            }
        }else if(dq.front()=='L'){
            x*=2;
        }else if(dq.front()=='R'){
            x*=2;
            x++;
        }
        dq.pop_front();
    }
    cout<<x;
    return 0;
}