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.
[[97, -155, 89, 23, -42, -149], [-85, 42, 68, -20, -116], [-148, 41, -143], [-46, 12, 54, -176], [-141, -162, 76, -36, -107], [-2, -9, -54, -35], [-67, -26, -107, 85, -114, 46, -117], [18, -36, -61, 37, -45], [-89, -151, -39]]