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.
[[-43, 56, -146], [-116, 61, -179, -81], [-72, 50, -34, -87], [-144, -24], [25, -141, -35, 92, -46, -119, 100], [23, -175, -97, -77, -179, -27, -105]]