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.
[[56, -13, -33, -25], [-188, 96, -142, -1, -181], [-145, -144], [-15, -179, -90], [-92, 46, -12, -23, -37], [-67, -190, -46], [-177, 8, -155, -76], [1, -134, -123, -134]]