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.
[[23, 62, -143, 38, -115, -138], [-72, -16, -177, -82, -128, -135], [2, 68, -161, -8, 61, -185], [-143, 20, -58, 27, -153], [8, 21, 53], [66, -95, 75, 54], [-83, -5, -22, -108, 47, 51, -88], [-120, -60, -131, -62, -91, -195], [-167, -47, 69, 91]]