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.
[[-163, -11], [70, -167, 19, 8], [-180, -67, 66, -131], [-164, -69, -141, -91, -149, -120, -40], [-73, -34], [-47, -158, -156], [8, 95, -95, -7, -40, 1, 27], [-121, 99, -163, 64, -176, 18, -34], [-181, -176, 10, -194]]