#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
#include<map>
#include<vector>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<queue>
using namespace std;
#define L long long
struct node{int l , r ;int z ;
}tr[100000 * 5];
int mark[100000 * 5] ;
int n , m ;
node in[100500] ;int maxx ;void crea(int ro , int l ,int r ) {tr[ro].l = l ;tr[ro].r = r ;tr[ro].z = 0 ;if(l == r)return ;int mid = (l + r) / 2 ;crea(ro*2 , l , mid ) ;crea(ro*2+1, mid + 1 , r) ;
}
void pushdown(int ro) {if(mark[ro] == 0) {return ;}if(tr[ro].l == tr[ro].r) return ;mark[ro*2] |= mark[ro] ;mark[ro*2+1] |= mark[ro] ;tr[ro*2].z |= mark[ro] ;tr[ro*2+1].z |= mark[ro] ;mark[ro] = 0 ;return ;
}int query(int ro , int l , int r ){pushdown(ro) ;if(l <= tr[ro].l && r >= tr[ro].r) {return tr[ro].z ;}int mid = (tr[ro].l + tr[ro].r) / 2 ;if(r <= mid) {return query(ro*2 , l , r ) ;}else if(l >= mid + 1 ) {return query(ro*2+1 , l , r ) ;}else {return query(ro*2 , l , r ) & query(ro*2+1 , l , r ) ;}
}void upda(int ro , int l , int r , int z) {pushdown(ro) ;if(l <= tr[ro].l && r >= tr[ro].r) {tr[ro].z |= z ;mark[ro] = z ;return ;}if(tr[ro].l == tr[ro].r) return ;int mid = (tr[ro].l + tr[ro].r) / 2 ;if(r <= mid){upda(ro*2 , l , r , z) ;}else if(l >= mid + 1) {upda(ro*2+1 , l , r , z) ;}else {upda(ro*2 , l , mid , z) ;upda(ro*2+1 , mid + 1 , r , z) ;}tr[ro].z = tr[ro*2].z & tr[ro*2+1].z ;
}int main(){while(scanf("%d%d",&n,&m)!=EOF){maxx = (1 << 31)- 1 ;for(int i = 0 ; i <= n * 5 - 5 ; i ++ ) {mark[i] = 0 ;}crea(1,1,n) ;for(int i = 1; i <= m ; i ++ ){scanf("%d%d%d" , &in[i].l, &in[i].r , &in[i].z) ;upda(1 , in[i].l , in[i].r , in[i].z) ;}bool ok = true ;for(int i = 1; i <= m ; i ++ ){int z = query(1 , in[i].l , in[i].r ) ;if(z != in[i].z) {ok = false ;break ;}}if(ok) {printf("YES\n") ;for(int i = 1; i <= n ; i ++ ){printf("%d",query(1,i,i)) ;if(i == n)printf("\n");else printf(" ") ;}}else {printf("NO\n") ;}}
}