Bug Report for https://neetcode.io/problems/python-heap-n-smallest

Please describe the bug below and include any steps to reproduce the bug or screenshots if possible.

The time complexity of heapq.nsmallest() is O(n log(m)) not O(m log(n))