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.
[[51, 33, 75, -92, -103, 55], [39, 70, -163, -158, -189, -40], [-192, 52, -42, 95, 77], [59, -152, -54, -103], [-67, 91, -44, 6, -23], [-88, -114, -57], [-35, 60, -58, 35, 74, -6, -149]]