#include <bits/stdc++.h>
using namespace std;
struct debugger {
  template <typename T>
  debugger &operator,(const T &v) {
    cerr << v << " ";
    return *this;
  }
} dbg;
inline long long gcd(long long a, long long b) {
  a = ((a) < 0 ? -(a) : (a));
  b = ((b) < 0 ? -(b) : (b));
  while (b) {
    a = a % b;
    swap(a, b);
  }
  return a;
}
long long ext_gcd(long long A, long long B, long long *X, long long *Y) {
  long long x2, y2, x1, y1, x, y, r2, r1, q, r;
  x2 = 1;
  y2 = 0;
  x1 = 0;
  y1 = 1;
  for (r2 = A, r1 = B; r1 != 0;
       r2 = r1, r1 = r, x2 = x1, y2 = y1, x1 = x, y1 = y) {
    q = r2 / r1;
    r = r2 % r1;
    x = x2 - (q * x1);
    y = y2 - (q * y1);
  }
  *X = x2;
  *Y = y2;
  return r2;
}
inline long long modInv(long long a, long long m) {
  long long x, y;
  ext_gcd(a, m, &x, &y);
  x %= m;
  if (x < 0) x += m;
  return x;
}
inline long long power(long long a, long long p) {
  long long res = 1, x = a;
  while (p) {
    if (p & 1) res = (res * x);
    x = (x * x);
    p >>= 1;
  }
  return res;
}
inline long long bigmod(long long a, long long p, long long m) {
  long long res = 1 % m, x = a % m;
  while (p) {
    if (p & 1) res = (res * x) % m;
    x = (x * x) % m;
    p >>= 1;
  }
  return res;
}
inline int STRLEN(char *s) {
  int p = 0;
  while (s[p]) p++;
  return p;
}
int dir8[8][2] = {{-1, 0},  {0, 1}, {1, 0},  {0, -1},
                  {-1, -1}, {1, 1}, {1, -1}, {-1, 1}};
const long long inf = 2147383647;
const long long mod = 1e9 + 7;
const double pi = 2 * acos(0.0);
const double eps = 1e-9;
const int Size = 2000005;
long long N, Q, Level = 0;
char qry[100005];
map<long long, long long> parent;
long long pow2[65];
long long findNode(long long u, long long k, long long lvl, long long target) {
  if (u == target) return lvl;
  long long subSize = pow2[k];
  if (target < u) {
    long long v = u - subSize;
    parent[v] = u;
    return findNode(v, k - 1, lvl + 1, target);
  } else {
    long long v = u + subSize;
    parent[v] = u;
    return findNode(v, k - 1, lvl + 1, target);
  }
}
long long solve(long long cur) {
  if (N == 1) return 1;
  int len = STRLEN(qry);
  long long root = (N + 1) / 2LL;
  parent[root] = root;
  long long k = findNode(root, Level - 2, 0, cur);
  for (int idx = 0; idx < len; idx++) {
    if (qry[idx] == 'U') {
      cur = parent[cur];
      k--;
      if (k < 0) k = 0;
    } else if (qry[idx] == 'L') {
      long long pos = Level - k - 2;
      if (pos < 0) continue;
      long long subSize = pow2[pos];
      long long v = cur - subSize;
      parent[v] = cur;
      cur = v;
      k++;
    } else {
      long long pos = Level - k - 2;
      if (pos < 0) continue;
      long long subSize = pow2[pos];
      long long v = cur + subSize;
      parent[v] = cur;
      cur = v;
      k++;
    }
  }
  return cur;
}
int main() {
  pow2[0] = 1;
  for (long long i = 1; i <= 64; i++) {
    pow2[i] = pow2[i - 1] * 2LL;
  }
  scanf("%lld %lld", &N, &Q);
  long long pw = 1;
  while (pw < N + 1) {
    pw = pw * 2LL;
    Level++;
  }
  for (int i = 0; i < Q; i++) {
    long long u;
    scanf("%lld %s", &u, qry);
    long long res = solve(u);
    printf("%lld\n", res);
  }
}
