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.
[[31, -134, 49, -176, -91, -21, -199], [-180, -145, 0, -172, 5, -18, 27], [81, -196, 55, -145, 53, -93, 24], [55, 36, -60, -40, -79, -43, 17], [-53, -106, -181, -100], [-144, 31, -51, 34, 87], [-61, -188, -70, 45, -119]]