```python
import heapq

def k_smallest_pairs(nums1, nums2, k):
    if not nums1 or not nums2 or k <= 0:
        return []

    min_heap = []
    result = []

    for i in range(min(k, len(nums1))):
        heapq.heappush(min_heap, (nums1[i] + nums2[0], i, 0))

    while min_heap and len(result) < k:
        _sum, i, j = heapq.heappop(min_heap)
        
        result.append([nums1[i], nums2[j]])

        if j + 1 < len(nums2):
            heapq.heappush(min_heap, (nums1[i] + nums2[j + 1], i, j + 1))
            
    return result
```