/*************************************
* author: marvinthang *
* created: 08.06.2023 11:30:33 *
*************************************/
#include "wall.h"
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define left ___left
#define right ___right
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
#define MASK(i) (1LL << (i))
#define BIT(x, i) ((x) >> (i) & 1)
#define __builtin_popcount __builtin_popcountll
#define ALL(v) (v).begin(), (v).end()
#define REP(i, n) for (int i = 0, _n = (n); i < _n; ++i)
#define REPD(i, n) for (int i = (n); i--; )
#define FOR(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define FORD(i, b, a) for (int i = (b), _a = (a); --i >= _a; )
#define FORE(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORDE(i, b, a) for (int i = (b), _a = (a); i >= _a; --i)
#define scan_op(...) istream & operator >> (istream &in, __VA_ARGS__ &u)
#define print_op(...) ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
#include "debug.h"
#else
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
#define DB(...) 23
#define db(...) 23
#define debug(...) 23
#endif
template <class U, class V> scan_op(pair <U, V>) { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>) { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>) { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")"; else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
// end of template
const int MAX = 2e6 + 6;
struct Node {
int l, r;
Node(int l = 0, int r = MAX): l(l), r(r) {}
Node & operator += (const Node &other) {
l = max(min(l, other.r), other.l);
r = max(min(r, other.r), other.l);
return *this;
}
Node operator + (const Node &other) const {
return Node(*this) += other;
}
bool operator == (const Node &other) const {
return l == other.l && r == other.r;
}
} lazy[MAX << 2];
void pushDown(int i) {
if (lazy[i] == Node()) return;
lazy[i << 1] += lazy[i];
lazy[i << 1 | 1] += lazy[i];
lazy[i] = Node();
}
void update(int i, int l, int r, int u, int v, Node x) {
if (l >= v || r <= u) return;
if (u <= l && r <= v) {
lazy[i] += x;
return;
}
int m = l + r >> 1;
pushDown(i);
update(i << 1, l, m, u, v, x);
update(i << 1 | 1, m, r, u, v, x);
}
void get(int i, int l, int r, int res[]) {
if (r - l == 1) {
res[l] = lazy[i].l;
return;
}
int m = l + r >> 1;
pushDown(i);
get(i << 1, l, m, res);
get(i << 1 | 1, m, r, res);
}
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
REP(i, k) update(1, 0, n, left[i], right[i] + 1, op[i] == 1 ? Node(height[i], MAX) : Node(0, height[i]));
get(1, 0, n, finalHeight);
}
#ifdef LOCAL
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include "wall.h"
int main()
{
file("wall");
int n;
int k;
int i, j;
int status = 0;
status = scanf("%d%d", &n, &k);
assert(status == 2);
int* op = (int*)calloc(sizeof(int), k);
int* left = (int*)calloc(sizeof(int), k);
int* right = (int*)calloc(sizeof(int), k);
int* height = (int*)calloc(sizeof(int), k);
int* finalHeight = (int*)calloc(sizeof(int), n);
for (i = 0; i < k; i++){
status = scanf("%d%d%d%d", &op[i], &left[i], &right[i], &height[i]);
assert(status == 4);
}
buildWall(n, k, op, left, right, height, finalHeight);
for (j = 0; j < n; j++)
printf("%d\n", finalHeight[j]);
return 0;
}
#endif
