#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
bool on[N];
int n, m, x, par[N];
char c;
int chk(int x) {
  int d = 2;
  if (par[x] && x != 1) return par[x];
  while (d * d <= x) {
    if (x % d == 0) {
      if (par[x / d]) return par[x / d];
      if (par[d]) return par[d];
    }
    d++;
  }
  return 0;
}
int main() {
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    scanf("\n%c%d", &c, &x);
    if (c == '+') {
      if (on[x]) {
        printf("Already on\n");
        continue;
      }
      int t = chk(x);
      if (t == 0) {
        int d = 1;
        while (d * d <= x) {
          if (x % d == 0) par[d] = par[x / d] = x;
          d++;
        }
        on[x] = true;
        printf("Success\n");
      } else
        printf("Conflict with %d\n", t);
    } else {
      if (!on[x])
        printf("Already off\n");
      else {
        printf("Success\n");
        int d = 1;
        while (d * d <= x) {
          if (x % d == 0) par[d] = par[x / d] = 0;
          d++;
        }
        on[x] = false;
      }
    }
  }
  return 0;
}
