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, -106, 7, -41], [16, 61], [-69, -108, -112, -50, 29], [48, -126, -50, -131, 9, 40], [30, 89], [-136, 6, -186, -71, 93], [79, -37, 8, 1, -129], [-23, -33, -135], [87, 89, -134]]