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.
[[-181, -129], [-167, -180], [-189, -11, -179, 47, -34, -147, -85], [-115, -41, -99, -168, -196, -21], [-68, -124, -195, -181, 74, -43, 9], [-161, 26, -191, -130, 62], [-25, 97, -120], [-182, -61, 61, -168, -138]]