Find the Kth Smallest Element Across Multiple Sorted Lists

Given M sorted lists of potentially different lengths, find the Kth smallest (or largest) element across all lists. Each individual list is sorted in ascending order. This problem is typically solved using a min-heap (priority queue) for an efficient k-way merge approach, achieving O(K log M) time complexity.