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.
[[-169, -75, 57, -96], [59, -106, -138, -87, -9], [-23, -70, -59, -46, 43, -15, 29], [-49, 46, -62, 52, 51], [-136, 95, 62, -57], [-155, -104, -141], [60, 81, 17, 55, -131], [36, -147], [-10, 82, 19, 75, -139]]