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.
[[-146, -188, -51, -146, -106, 100, -121], [-17, -194, 95, 93, -187], [-182, -91, -190, -65, -48, 75, -91], [20, -71, -71, 50, -66, -11, -146], [-188, -11, -10, 57]]