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.
[[-191, 65, -184, -146], [-87, 81, -99, 58, -144, -15, 78], [-11, -56, -27], [79, -159, -135, -16, 33, -105], [-72, 88, -22, -97, -124], [-140, -146, 27, -151, -51, -152], [-156, -199, 29]]