In this task, you are given a list. This list contains many lists of integers. The list is several items written within a []. Your task is to find the maximum number among the members of each inner list. The output should be a list comprised of the maximums with the same order as the internal lists.
[[-113, 61, 50], [-169, 56, 81, -114], [-8, -196], [-158, -90, -17]]