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.
[[-16, -18, 80], [-9, 72, -134, -91, -45, 44], [-5, -127, 49, -11, -180, -179, -185], [-90, -176, -17, -57, 99], [-16, -108, 43], [80, -29, -38, 46, -42, -117, 88], [89, -33, 10, -61, -97, -65], [21, 18, -38, -69]]