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.
[[53, -8, 37], [31, -162, -194, -175, 2], [-192, -27], [-49, -59, -92, -126, -122], [-64, 81, -154, 65], [-97, -163, -136, -155], [-153, -69, -181, 58, -32], [-121, -105, -127, -61, 93, 2, 84], [86, -166, -151, -153, 5, 29]]