#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
template <class T>
using V = vector<T>;
template <class T, size_t SZ>
using AR = array<T, SZ>;
template <class T>
using PR = pair<T, T>;
const int MOD = 1e9 + 7;
const int MX = 2e5 + 5;
const ll INF = 1e18;
const ld PI = acos((ld)-1);
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
template <class T>
using pqg = priority_queue<T, vector<T>, greater<T>>;
constexpr int pct(int x) { return __builtin_popcount(x); }
constexpr int bits(int x) { return 31 - __builtin_clz(x); }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); }
ll fdiv(ll a, ll b) { return a / b - ((a ^ b) < 0 && a % b); }
template <class T>
bool ckmin(T& a, const T& b) {
  return b < a ? a = b, 1 : 0;
}
template <class T>
bool ckmax(T& a, const T& b) {
  return a < b ? a = b, 1 : 0;
}
template <class T, class U>
T fstTrue(T lo, T hi, U first) {
  hi++;
  assert(lo <= hi);
  while (lo < hi) {
    T mid = lo + (hi - lo) / 2;
    first(mid) ? hi = mid : lo = mid + 1;
  }
  return lo;
}
template <class T, class U>
T lstTrue(T lo, T hi, U first) {
  lo--;
  assert(lo <= hi);
  while (lo < hi) {
    T mid = lo + (hi - lo + 1) / 2;
    first(mid) ? lo = mid : hi = mid - 1;
  }
  return lo;
}
template <class T>
void remDup(vector<T>& v) {
  sort(begin(v), end(v));
  v.erase(unique(begin(v), end(v)), end(v));
}
template <class T, class U>
void erase(T& t, const U& u) {
  auto it = t.find(u);
  assert(it != end(t));
  t.erase(u);
}
template <class T>
void re(complex<T>& c);
template <class T, class U>
void re(pair<T, U>& p);
template <class T>
void re(vector<T>& v);
template <class T, size_t SZ>
void re(AR<T, SZ>& a);
template <class T>
void re(T& x) {
  cin >> x;
}
void re(db& d) {
  str t;
  re(t);
  d = stod(t);
}
void re(ld& d) {
  str t;
  re(t);
  d = stold(t);
}
template <class T, class... U>
void re(T& t, U&... u) {
  re(t);
  re(u...);
}
template <class T>
void re(complex<T>& c) {
  T a, b;
  re(a, b);
  c = {a, b};
}
template <class T, class U>
void re(pair<T, U>& p) {
  re(p.first, p.second);
}
template <class T>
void re(vector<T>& x) {
  for (auto& a : x) re(a);
}
template <class T, size_t SZ>
void re(AR<T, SZ>& x) {
  for (auto& a : x) re(a);
}
str to_string(char c) { return str(1, c); }
str to_string(const char* second) { return (str)second; }
str to_string(str second) { return second; }
str to_string(bool b) { return to_string((int)b); }
template <class T>
str to_string(complex<T> c) {
  stringstream ss;
  ss << c;
  return ss.str();
}
str to_string(vector<bool> v) {
  str res = "{";
  for (int i = (0); i < ((int)(v).size()); ++i) res += char('0' + v[i]);
  res += "}";
  return res;
}
template <size_t SZ>
str to_string(bitset<SZ> b) {
  str res = "";
  for (int i = (0); i < (SZ); ++i) res += char('0' + b[i]);
  return res;
}
template <class T, class U>
str to_string(pair<T, U> p);
template <class T>
str to_string(T v) {
  bool fst = 1;
  str res = "";
  for (const auto& x : v) {
    if (!fst) res += " ";
    fst = 0;
    res += to_string(x);
  }
  return res;
}
template <class T, class U>
str to_string(pair<T, U> p) {
  return to_string(p.first) + " " + to_string(p.second);
}
template <class T>
void pr(T x) {
  cout << to_string(x);
}
template <class T, class... U>
void pr(const T& t, const U&... u) {
  pr(t);
  pr(u...);
}
void ps() { pr("\n"); }
template <class T, class... U>
void ps(const T& t, const U&... u) {
  pr(t);
  if (sizeof...(u)) pr(" ");
  ps(u...);
}
void DBG() { cerr << "]" << endl; }
template <class T, class... U>
void DBG(const T& t, const U&... u) {
  cerr << to_string(t);
  if (sizeof...(u)) cerr << ", ";
  DBG(u...);
}
void setIn(str second) { freopen(second.c_str(), "r", stdin); }
void setOut(str second) { freopen(second.c_str(), "w", stdout); }
void unsyncIO() { cin.tie(0)->sync_with_stdio(0); }
void setIO(str second = "") {
  unsyncIO();
  cin.exceptions(cin.failbit);
  if ((int)(second).size()) {
    setIn(second + ".in"), setOut(second + ".out");
  }
}
const int MM = 1e5 + 5;
int n, m;
bool active[MM];
int main() {
  setIO();
  cin >> n >> m;
  multiset<int> push_front;
  unordered_map<int, multiset<int>> nums;
  for (int i = 0; i < m; i++) {
    char t;
    int x;
    cin >> t >> x;
    int org = x;
    if (t == '+') {
      if (active[x])
        cout << "Already on\n";
      else {
        bool bad = 0, fst = 1;
        multiset<int> cur;
        while (x % 2 == 0) {
          x /= 2;
          if (fst) {
            fst = 0;
            cur.insert(2);
            if (push_front.find(2) != push_front.end()) {
              bad = 1;
              break;
            }
          }
        }
        if (bad) {
          cout << "Conflict with " << *nums[2].begin() << "\n";
          continue;
        }
        for (int i = 3; i * i <= x && !bad; i += 2) {
          bool fst = 1;
          while (x % i == 0) {
            if (fst) {
              fst = 0;
              cur.insert(i);
              if (push_front.find(i) != push_front.end()) {
                bad = 1;
                cout << "Conflict with " << *nums[i].begin() << "\n";
                break;
              }
            }
            x /= i;
          }
        }
        if (bad) continue;
        if (x > 2) {
          if (push_front.find(x) != push_front.end()) {
            cout << "Conflict with " << *nums[x].begin() << "\n";
            bad = 1;
            continue;
          }
          cur.insert(x);
        }
        cout << "Success\n";
        for (int xx : cur) nums[xx].insert(org);
        if (push_front.size() < cur.size()) {
          swap(push_front, cur);
        }
        for (int x : cur) push_front.insert(x);
        active[org] = 1;
      }
    } else {
      if (!active[x])
        cout << "Already off\n";
      else {
        bool fst = 1;
        while (x % 2 == 0) {
          x /= 2;
          if (fst) {
            fst = 0;
            push_front.erase(push_front.find(2));
            nums[2].erase(nums[2].find(org));
          }
        }
        for (int i = 3; i * i <= x; i += 2) {
          bool fst = 1;
          while (x % i == 0) {
            if (fst) {
              fst = 0;
              push_front.erase(push_front.find(i));
              nums[i].erase(nums[i].find(org));
            }
            x /= i;
          }
        }
        if (x > 2) {
          push_front.erase(push_front.find(x));
          nums[x].erase(nums[x].find(org));
        }
        cout << "Success\n";
        active[org] = 0;
      }
    }
  }
}
