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.
[[0, 75, -59, -53, -126, -24], [-149, -50], [-8, -66, 12, -128, -164, -14], [-179, -38, -75, -104, -177], [-97, -112, -132, -24, -12, 17, -148], [5, 88, -18, 98, 25], [98, 71, -196, -153, -18, -87, -71], [-190, -139, -160, -95], [-168, 13, 52, 96, 5, -197]]