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, -79], [29, -83], [36, -66, -60, -45, 66], [49, -158, 23, -114], [-45, -41], [-47, -68, 1, 76], [45, -91]]