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.
[[-46, -40, 14], [15, -131, 51, 59, -1, 93], [9, 58, -39, -25, -185, -108, -154], [-34, -107, -27, 5, 76, -115], [69, -2, 40, -6, 87, -134], [-90, -125], [-4, -130, 64], [71, 43, -150, -180]]