def find_continuous_k_naive(l, k):
    """
    Naive solution
    Iterate through elements of the list and build subarrays forward
    Check the sum of which sub-array as you go
    Complexity: O(n^2)
    """
    results = []
    for i in range(len(l)):
        sum = 0
        j = i
        while j<len(l):
            sum += l[j]
            if sum == k:
                results.append(l[i:j+1])
            elif sum > k:
                break
            j += 1
    return results