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.
[[26, 99, -47, 57, 46, 69], [30, 22, -15, 44, 33, -172], [46, -9, 24, -121, -163, -139, -129], [-151, 51], [82, -1, -47, -178, 83, -89, -99], [19, 99, -66, 90]]