#include<iostream>
#include<cstdio>
#include<list>
#include<string>
#include<cstring>
#include<sstream>
#include<cctype>
#include<string.h>
#include<algorithm>
#include<cmath>
#include<stack>
#include<fstream>
#include<cstdlib>
#include<vector>
#include<map>
#include<set>
#include<utility>
#include<iomanip>
#include<queue>
#include<deque>
#include<iterator>
#include<assert.h>
#include<bitset>
#include<climits>
#include<ctime>
#include<complex>
using namespace std;
#define SET(a) memset(a,-1,sizeof(a))
#define ALL(a) a.begin(),a.end()
#define CLR(a) memset(a,0,sizeof(a))
#define PB push_back
#define PI acos(-1.0)
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define READ freopen("input.txt", "r", stdin)
#define WRITE freopen("output.txt", "w", stdout)
#define LL long long
#define S(a) scanf("%d",&a)
#define S2(a,b) scanf("%d%d",&a,&b)
#define KS printf("Case %d: ",kk++)
#define MOD 1000000007
#define MX 1000010
bool arr[MX+2];
int main()
{
int a,b,c,w,x,y,z,n,m,u,v,cnt,mx,mn,p,q,r,sum,inter,st,ed;
string s,s2;
while(cin>>n>>m)
{
if(!n && !m) break;
CLR(arr);
bool chk=true;
for(int i=0;i<n;i++)
{
cin>>x>>y;
if(chk)
for(int j=x;j<y;j++)
{
if(arr[j])
{
chk=false;
break;
}
else arr[j]=1;
}
}
for(int i=0;i<m;i++)
{
cin>>x>>y>>inter;
if(chk)
{
st=x;
ed=y;
while(st<MX)
{
if(ed>MX)
ed=MX;
for(int j=st;j<ed;j++)
{
if(arr[j])
{
chk=false;
break;
}
else arr[j]=1;
}
if(!chk) break;
st+=inter;
ed+=inter;
}
}
}
if(chk) cout<<"NO CONFLICT"<<endl;
else cout<<"CONFLICT"<<endl;
}
return 0;
}
torlarioyo Clayton Jones https://wakelet.com/wake/fhB0_tyYSltekmJtixUOq
ReplyDeleteadabsmoulsub
Uputcaimae_tsu1993 Maykol Kane Adobe Acrobat Pro DC
ReplyDeleteFastStone Capture
DesignCAD 3D Max
beaucomsokee