Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np
N,C=map(int,input().split())
 
def get_unique_list(seq):
  seen = []
  return [x for x in seq if x not in seen and not seen.append(x)]
 
Record=np.empty((0,3), int)
 
for i in range(N):
  lis=list(map(int,input().split()))
  n=np.array(lis)
  Record=np.append(Record,[n],axis=0)
#print(Record)
 
 
newRecord=np.empty((0,3), int)
for c in range(C):
  Recordi=np.empty((0,3), int)
  for i in range(N):
    if Record[i][2]==c+1:
      Recordi=np.append(Recordi,[Record[i]],axis=0)
  
  sort_Recordi=Recordi[np.argsort(Recordi[:,0])]
  #print(sort_Recordi)
  for j in range(len(sort_Recordi)-1):
    if sort_Recordi[j][1]==sort_Recordi[j+1][0]:
      sort_Recordi[j][1]=sort_Recordi[j+1][1]
      sort_Recordi[j+1][0]=sort_Recordi[j][0]
  sort_Recordi_u=set(map(tuple,sort_Recordi))
  sort_Recordi_u=np.array(list(sort_Recordi_u))
  #print(sort_Recordi_u)
  for k in range(len(sort_Recordi_u)):
    newRecord=np.append(newRecord,[sort_Recordi_u[k]],axis=0)
    
      
#print(newRecord)
nofc=np.zeros(10**5+1,dtype=int)
 
for a in newRecord:
  vec=np.ones(a[1]-a[0]+1,dtype=int)
  nofc[a[0]:a[1]+1]+=vec
#print(vec)
#print(nofc[:13])
print(int(max(nofc)))

Fixed submission:
import numpy as np
N,C=map(int,input().split())

nofc=np.zeros((C,10**5),dtype=int)

for i in range(N):
  s,t,c=map(int,input().split())
  vec=np.ones(t-s+1,dtype=int)
  nofc[c-1][s-1:t]=vec
print(int(max(np.sum(nofc,axis=0))))

Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np
N,C=map(int,input().split())
 
def get_unique_list(seq):
  seen = []
  return [x for x in seq if x not in seen and not seen.append(x)]

Record=np.empty((0,3), int)
 
for i in range(N):
  lis=list(map(int,input().split()))
  n=np.array(lis)
  Record=np.append(Record,[n],axis=0)
#print(Record)


newRecord=np.empty((0,3), int)
for c in range(C):
  Recordi=np.empty((0,3), int)
  for i in range(N):
    if Record[i][2]==c+1:
      Recordi=np.append(Recordi,[Record[i]],axis=0)
  
  sort_Recordi=Recordi[np.argsort(Recordi[:,0])]
  #print(sort_Recordi)
  for j in range(len(sort_Recordi)-1):
    if sort_Recordi[j][1]==sort_Recordi[j+1][0]:
      sort_Recordi[j][1]=sort_Recordi[j+1][1]
      sort_Recordi[j+1][0]=sort_Recordi[j][0]
  sort_Recordi_u=set(map(tuple,sort_Recordi))
  sort_Recordi_u=np.array(list(sort_Recordi_u))
  #print(sort_Recordi_u)
  for k in range(len(sort_Recordi_u)):
    newRecord=np.append(newRecord,[sort_Recordi_u[k]],axis=0)
    
      
#print(newRecord)
nofc=np.zeros(10**5+1)
 
for a in newRecord:
  vec=np.ones(a[1]-a[0]+1)
  nofc[a[0]:a[1]+1]+=vec
#print(vec)
#print(nofc[:13])
print(int(max(nofc)))

Fixed submission:
import numpy as np
N,C=map(int,input().split())

nofc=np.zeros((C,10**5),dtype=int)

for i in range(N):
  s,t,c=map(int,input().split())
  vec=np.ones(t-s+1,dtype=int)
  nofc[c-1][s-1:t]=vec
print(int(max(np.sum(nofc,axis=0))))

Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np
N,C=map(int,input().split())

def get_unique_list(seq):
  seen = []
  return [x for x in seq if x not in seen and not seen.append(x)]
  


Record=[]

for i in range(N):
  Record.append(list(map(int,input().split())))

newRecord=[]
for c in range(C):
  Recordi=[]
  for i in range(N):
    if Record[i][2]==c+1:
      Recordi.append(Record[i])
  sort_Recordi=sorted(Recordi,key = lambda x:x[0])
  for j in range(len(sort_Recordi)-1):
    if sort_Recordi[j][1]==sort_Recordi[j+1][0]:
      sort_Recordi[j][1]=sort_Recordi[j+1][1]
      sort_Recordi[j+1][0]=sort_Recordi[j][0]
  sort_Recordi_u=get_unique_list(sort_Recordi)
  #print(sort_Recordi_u)
  for k in range(len(sort_Recordi_u)):
    newRecord.append(sort_Recordi_u[k])
    
      
#print(newRecord)
nofc=np.zeros(10**5+1)

for a in newRecord:
  vec=np.ones(a[1]-a[0]+1)
  nofc[a[0]:a[1]+1]+=vec
#print(vec)
#print(nofc[:13])
print(int(max(nofc)))

Fixed submission:
import numpy as np
N,C=map(int,input().split())

nofc=np.zeros((C,10**5),dtype=int)

for i in range(N):
  s,t,c=map(int,input().split())
  vec=np.ones(t-s+1,dtype=int)
  nofc[c-1][s-1:t]=vec
print(int(max(np.sum(nofc,axis=0))))