#include using namespace std; #define FOR(i,m,n) for(int i=(m);i<(n);++i) #define REP(i,n) FOR(i,0,n) #define ALL(v) (v).begin(),(v).end() using ll = long long; constexpr int INF = 0x3f3f3f3f; constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL; constexpr double EPS = 1e-8; constexpr int MOD = 998244353; // constexpr int MOD = 1000000007; constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1}; constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}; constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1}; template inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; } template inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; } struct IOSetup { IOSetup() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << fixed << setprecision(20); } } iosetup; template struct LiChaoTree { struct Line { T a, b; explicit Line(const T a, const T b) : a(a), b(b) {} T f(const T x) const { return a * x + b; } }; explicit LiChaoTree(const std::vector& xs_, const T inf) : n(1), xs(xs_) { std::sort(xs.begin(), xs.end()); xs.erase(std::unique(xs.begin(), xs.end()), xs.end()); assert(xs.size() > 0); n = std::bit_ceil(xs.size()); const T xs_back = xs.back(); xs.resize(n, xs_back); dat.assign(n << 1, Line(0, inf)); } void add(T a, T b) { if constexpr (!IS_MINIMIZED) { a = -a; b = -b; } Line line(a, b); add(&line, 1, 0, n); } void add(T a, T b, T left, T right) { if constexpr (!IS_MINIMIZED) { a = -a; b = -b; } for (int len = 1, node_l = std::distance( xs.begin(), std::lower_bound(xs.begin(), xs.end(), left)), node_r = std::distance( xs.begin(), std::lower_bound(xs.begin(), xs.end(), right)), l = node_l + n, r = node_r + n; l < r; l >>= 1, r >>= 1, len <<= 1) { if (l & 1) { Line line(a, b); add(&line, l++, node_l, node_l + len); node_l += len; } if (r & 1) { Line line(a, b); node_r -= len; add(&line, --r, node_r, node_r + len); } } } T query(const T x) const { int node = n + std::distance(xs.begin(), std::lower_bound(xs.begin(), xs.end(), x)); T res = dat[node].f(x); while (node >>= 1) { if (dat[node].f(x) < res) res = dat[node].f(x); } return IS_MINIMIZED ? res : -res; } private: int n; std::vector xs; std::vector dat; void add(Line* line, int node, int left, int right) { const bool flag_l = dat[node].f(xs[left]) <= line->f(xs[left]); const bool flag_r = dat[node].f(xs[right - 1]) <= line->f(xs[right - 1]); if (flag_l && flag_r) return; if (!flag_l && !flag_r) { std::swap(dat[node], *line); return; } const int mid = std::midpoint(left, right); if (line->f(xs[mid]) < dat[node].f(xs[mid])) std::swap(dat[node], *line); if (line->f(xs[left]) <= dat[node].f(xs[left])) { add(line, node << 1, left, mid); } else { add(line, (node << 1) + 1, mid, right); } } }; int main() { int a, q; cin >> a >> q; vector s(q, -1), t(q); vector xs; xs.reserve(q); REP(i, q) { int type; cin >> type; if (type == 1) { cin >> s[i] >> t[i]; } else if (type == 2) { cin >> t[i]; xs.emplace_back(t[i]); } } ranges::sort(xs); xs.erase(unique(xs.begin(), xs.end()), xs.end()); LiChaoTree li_chao_tree(xs, LINF); REP(i, q) { if (s[i] == -1) { cout << max(li_chao_tree.query(t[i]) - 1LL * a * t[i] * t[i], 0LL) << '\n'; } else { li_chao_tree.add(1LL * a * (s[i] + t[i]), -1LL * a * s[i] * t[i]); } } return 0; }