#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


template <class T> struct PQue {
  priority_queue<T> que0, que1;
  int size() const {
    return que0.size() - que1.size();
  }
  void push(const T &t) {
    que0.push(t);
  }
  void erase(const T &t) {
    que1.push(t);
  }
  void reduce() {
    for (; que0.size() && que1.size() && que0.top() == que1.top(); que0.pop(), que1.pop()) {}
  }
  const T &top() {
    reduce();
    assert(que0.size());
    return que0.top();
  }
  void pop() {
    reduce();
    assert(que0.size());
    que0.pop();
  }
};


/*
  2 3 5 7 11 13 = 30030
  2 3 5 7 11 13 17 = 510510
  
  log_(6/5) (2^32) ~ 122
*/

int main() {
  int N, Q;
  for (; ~scanf("%d%d", &N, &Q); ) {
    vector<vector<int>> pss(N + 1);
    for (int p = 2; p <= N; ++p) if (!pss[p].size()) {
      for (int n = p; n <= N; n += p) pss[n].push_back(p);
    }
    
    vector<Int> damage(N, 0);
    // vector<set<pair<Int, int>>> ss(N);
    vector<PQue<pair<Int, int>>> ss(N);
    vector<int> xs(Q + 1, 0);
    vector<Int> ys(Q + 1, 0);
    vector<vector<Int>> inserted(Q + 1);
    
    vector<int> que;
    auto update = [&](int u) -> void {
      const auto &ps = pss[xs[u]];
      const int psLen = ps.size();
      Int hp = ys[u];
      for (const int p : ps) {
        hp -= damage[p];
      }
      if (inserted[u].size()) {
        for (int i = 0; i < psLen; ++i) {
          // assert(ss[ps[i]].erase(make_pair(inserted[u][i], u)));
          ss[ps[i]].erase(make_pair(inserted[u][i], u));
        }
      } else {
        inserted[u].resize(psLen);
      }
      if (hp <= 0) {
        que.push_back(u);
      } else {
        for (int i = 0; i < psLen; ++i) {
          // ss[ps[i]].emplace(inserted[u][i] = damage[ps[i]] + (hp - 1 + i) / psLen, u);
          ss[ps[i]].push(make_pair(inserted[u][i] = damage[ps[i]] + (hp - 1 + i) / psLen, u));
        }
      }
    };
    
    Int lastans = 0;
    int id = 0;
    for (int q = 0; q < Q; ++q) {
      int O, X;
      Int Y;
      scanf("%d%d%lld", &O, &X, &Y);
      Y ^= lastans;
// cerr<<COLOR("33")<<O<<" "<<X<<" "<<Y<<COLOR()<<endl;
      if (O == 0) {
        for (const int p : pss[X]) {
          damage[p] += Y;
        }
        for (const int p : pss[X]) {
          // for (; ss[p].size() && ss[p].begin()->first < damage[p]; ) {
          for (; ss[p].size() && ss[p].top().first < damage[p]; ) {
            // update(ss[p].begin()->second);
            update(ss[p].top().second);
          }
        }
        vector<int> ans;
        ans.swap(que);
        sort(ans.begin(), ans.end());
        printf("%d", (int)ans.size());
        for (const int u : ans) {
          printf(" %d", u);
        }
        puts("");
        lastans = ans.size();
      } else if (O == 1) {
        const int u = ++id;
        xs[u] = X;
        ys[u] = Y;
        for (const int p : pss[X]) {
          ys[u] += damage[p];
        }
        update(u);
      } else {
        assert(false);
      }
    }
  }
  return 0;
}