diff --git a/greedy_methods/smallest_range.py b/greedy_methods/smallest_range.py
index e2b7f8d7e..9adb12bf9 100644
--- a/greedy_methods/smallest_range.py
+++ b/greedy_methods/smallest_range.py
@@ -14,12 +14,13 @@ def smallest_range(nums: list[list[int]]) -> list[int]:
     Uses min heap for efficiency. The range includes at least one number from each list.
 
     Args:
-        nums: List of k sorted integer lists.
+        `nums`: List of k sorted integer lists.
 
     Returns:
         list: Smallest range as a two-element list.
 
     Examples:
+
     >>> smallest_range([[4, 10, 15, 24, 26], [0, 9, 12, 20], [5, 18, 22, 30]])
     [20, 24]
     >>> smallest_range([[1, 2, 3], [1, 2, 3], [1, 2, 3]])