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.
[[36, -151, -9, -118, 96], [-47, 75, -4], [27, 65, -190, -24, -71, -83], [-40, -81, 79], [90, -95, -55, -49, -10, 61, -51], [11, -32, -189], [-58, 88, 37, 83, -197, -159], [-35, 53, -69, 11, -169]]