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.
[[-155, 31, 88, 41], [-111, -59, 18, -101, 60, -153, -72], [23, 37, 10, -139], [-114, -110, 76, -116, -175], [-72, -83, -184, -30, 92, 6, -151], [-200, -128, -146], [11, -20], [-4, 33, -196, 84], [-160, -12, 27, -160, -8]]