Cycle finder for discrete logarithm problem

cycle-finder.py

def find_cyclic(p, g) -> int:
	seen = set()
	current = g
	while True:
		current *= g
		current %= p
		if current in seen:
			print(sorted(seen))
			print(len(seen))
			return len(seen)
		seen.add(current)

#find_cyclic(1971, 2)
#exit()
l = list()
for i in range(1501, 2000, 2):
	l.append((i, find_cyclic(i, 2)))
l.sort(key=lambda x: x[1])
print(l)