#include <bits/stdc++.h>
using namespace std;
template <typename A>
ostream &operator<<(ostream &cout, vector<A> const &v);
template <typename A, typename B>
ostream &operator<<(ostream &cout, pair<A, B> const &p) {
  return cout << "(" << p.first << ", " << p.second << ")";
}
template <typename A>
ostream &operator<<(ostream &cout, vector<A> const &v) {
  cout << "[";
  for (int i = 0; i < v.size(); i++) {
    if (i) cout << ", ";
    cout << v[i];
  }
  return cout << "]";
}
template <typename A, typename B>
istream &operator>>(istream &cin, pair<A, B> &p) {
  cin >> p.first;
  return cin >> p.second;
}
mt19937_64 rng(std::chrono::steady_clock::now().time_since_epoch().count());
void usaco(string filename) {
  freopen((filename + ".in").c_str(), "r", stdin);
  freopen((filename + ".out").c_str(), "w", stdout);
}
const long double pi = 3.14159265358979323846;
long long n, m, q, k, l, r, x, y, z;
const long long template_array_size = 1e6 + 16318;
long long a[template_array_size];
long long b[template_array_size];
long long c[template_array_size];
string second, t;
long long ans = 0;
bool vis[1050];
void query(long long p) {
  cout << "? " << p + 1 << endl;
  cin >> second;
  if (second == "Y") vis[p] = 1;
}
void solve(int tc = 0) {
  cin >> n >> k;
  long long sz = (k + 1) / 2;
  for (long long gap = 0; sz * gap < n; gap++) {
    for (long long i = 0; i < sz * gap && i + sz * gap < n; i += sz) {
      for (long long j = i; j < n; j += sz * gap) {
        for (long long k = 0; k < sz; k++) {
          query(j + k);
        }
      }
      cout << "R" << endl;
    }
  }
  long long ans = 0;
  for (long long i = 0; i < n; i++) ans += !vis[i];
  cout << "! " << ans << endl;
}
int main() {
  { ios_base::sync_with_stdio(false); }
  { cin.tie(NULL); }
  cout << setprecision(15) << fixed;
  int tc = 1;
  for (int t = 0; t < tc; t++) solve(t);
}
