input: Write a function to find the longest increasing subsequences in a list.
  assert find_longest_increasing_subsequences([2, 4, 3, 5, 1, 7, 6]) == [[2, 3, 5, 7], [2, 4, 5, 7]]
  assert find_longest_increasing_subsequences([1, 2, 3, 4, 5]) == [[1, 2, 3, 4, 5]]
  assert find_longest_increasing_subsequences([5, 4, 3, 2, 1]) == [[5], [4], [3], [2], [1]]
output: def find_longest_increasing_subsequences(arr):
      if not arr:
          return []
  
      subsequences = [[num] for num in arr]
      for i in range(len(arr)):
          for j in range(i):
              if arr[j] < arr[i] and len(subsequences[j]) + 1 > len(subsequences[i]):
                  subsequences[i] = subsequences[j] + [arr[i]]
  
      max_length = max(len(subseq) for subseq in subsequences)
      longest_subsequences = [subseq for subseq in subsequences if len(subseq) == max_length]
  
      return longest_subsequences