------
## 最终结论
```python
from collections import Counter
import heapq

def func(lists, k):
    counter = Counter()
    for sublist in lists:
        counter.update(sublist)
    
    return [num for num, _ in heapq.nlargest(k, counter.items(), key=lambda x: x[1])]
```