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.
[[34, -141, -181, -19, -149], [28, -68, 76], [-143, -164, 76, -76, -167], [36, 16, -125, 31, -174, -20], [-100, 85, -130, -163, -144, -64, -100]]