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.
[[-135, 6, 32, -94, -171, -23, 45], [-97, -76, -119], [-181, -28, -160, 95, -37, 18], [-38, 88, 34, -117, -159, 61], [-122, -146, 44], [-10, -132, -23], [-144, -175], [-28, -196, -113, 38, 95, -6], [-159, 93, 0, 98, 73, -88, -24]]