#include <bits/stdc++.h>
using namespace std;
template <typename T>
void maxtt(T& t1, T t2) {
  t1 = max(t1, t2);
}
template <typename T>
void mintt(T& t1, T t2) {
  t1 = min(t1, t2);
}
bool debug = 0;
int n, m, k;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
string direc = "URDL";
const long long MOD2 = (long long)1000000007 * (long long)1000000007;
long long ln, lk, lm;
void etp(bool f = 0) {
  puts(f ? "YES" : "NO");
  exit(0);
}
void addmod(int& x, int y, int mod = 1000000007) {
  x += y;
  if (x >= mod) x -= mod;
  if (x < 0) x += mod;
  assert(x >= 0 && x < mod);
}
void et(int x = -1) {
  printf("%d\n", x);
  exit(0);
}
long long fastPow(long long x, long long y, int mod = 1000000007) {
  long long ans = 1;
  while (y > 0) {
    if (y & 1) ans = (x * ans) % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return ans;
}
long long gcd1(long long x, long long y) { return y ? gcd1(y, x % y) : x; }
bool rd(int x) {
  printf("? %d\n", x);
  fflush(stdout);
  char ope[5];
  scanf("%s", ope);
  return ope[0] == 'Y';
}
bool del[1300];
int B, ans;
void qy(int bid) {
  for (int i = bid * B; i < (bid + 1) * B; i++) {
    int j = i + 1;
    if (!del[j] && rd(j)) {
      del[j] = 1;
      ans--;
    }
  }
}
void fmain(int tid) {
  scanf("%d%d", &n, &k);
  B = max(k / 2, 1);
  m = n / B;
  ans = n;
  for (int i = 0; i < m / 2; i++) {
    puts("R");
    fflush(stdout);
    int d = 0;
    for (int(j) = 0; (j) < (int)(m); (j)++) {
      qy((i + d + m) % m);
      d = (d <= 0) - d;
    }
  }
  printf("! %d\n", ans);
}
int main() {
  int t = 1;
  for (int(i) = 1; (i) <= (int)(t); (i)++) {
    fmain(i);
  }
  return 0;
}
