from itertools import * from bisect import * # from math import * from collections import * from heapq import * from random import * from decimal import * import numpy as np import sys sys.setrecursionlimit(10 ** 6) int1 = lambda x: int(x) - 1 p2D = lambda x: print(*x, sep="\n") def II(): return int(sys.stdin.readline()) def MI(): return map(int, sys.stdin.readline().split()) def MI1(): return map(int1, sys.stdin.readline().split()) def MF(): return map(float, sys.stdin.readline().split()) def LI(): return list(map(int, sys.stdin.readline().split())) def LI1(): return list(map(int1, sys.stdin.readline().split())) def LF(): return list(map(float, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] dij = [(0, 1), (1, 0), (0, -1), (-1, 0)] def main(): def stod(s): res=int(s[0])*10000+int(s[2:4])*100+int(s[5:7]) return res n, m = MI() if n > m: print(m) exit() reserve = [] for _ in range(m): s = input() date0=stod(s[:7]) date1=stod(s[8:]) heappush(reserve, [date1,date0]) ans = 0 for _ in range(n): if not reserve:break room=[] pending=[] date1,date0=heappop(reserve) room.append([date1,date0]) checkout=date1 ans+=1 while reserve: date1, date0 = heappop(reserve) if date0>checkout: room.append([date1, date0]) checkout=date1 ans+=1 else: heappush(pending,[date0,date1]) date1,date0=room.pop() heappush(pending, [date0, date1]) if room: checkout=room[-1][0] while pending: date0,date1=heappop(pending) if date0>checkout: break else: heappush(reserve,[date1,date0]) else: heappop(pending) while pending: date0, date1 = heappop(pending) heappush(reserve, [date1, date0]) print(ans) main()