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.
[[-164, 67, 93, 93], [25, 6, -94, -124, -16, -8, -168], [-99, 32, 86], [14, -34], [-152, -139, -39, -15, -104], [-78, -162, -171, -61], [-42, -88, -70, -163, -147, -56], [-27, -2, 83], [-67, 50, -176, 64]]