#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
const long double PI = 3.14159265;
long long int powerWithMod(long long int base, long long int exponent,
                           long long int modulus = LLONG_MAX) {
  long long int result = 1;
  base %= modulus;
  while (exponent > 0) {
    if (exponent % 2 == 1) result = (result * base) % modulus;
    exponent >>= 1;
    base = (base * base) % modulus;
  }
  return result;
}
long long int modInverse(long long int a, long long int m = MOD) {
  return powerWithMod(a, m - 2, m);
}
int k, r;
unsigned long long int n, x;
string a;
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n >> k;
  while (k--) {
    cin >> x >> a;
    for (char c : a) {
      if (c == 'U') {
        if (x != (n + 1) / 2) {
          r = __builtin_ctzll(x);
          x ^= (1ULL << r);
          r++;
          if (!(x & (1ULL << r))) x ^= (1ULL << r);
          if (x > n) x ^= (1ULL << r);
        }
      } else if (c == 'R') {
        if (x & 1) continue;
        r = __builtin_ctzll(x) - 1;
        x |= (1LL << r);
      } else {
        if (x & 1) continue;
        r = __builtin_ctzll(x);
        x ^= (1ULL << r);
        r--;
        x ^= (1ULL << r);
      }
    }
    cout << x << "\n";
  }
  return 0;
}
