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.
[[-140, 36, -51, 41, 55, -71, -35], [-8, -147, -34, 2], [32, 21, 20], [-189, -40, 74, -26, 86, -35], [51, -62, 82, 63, -157], [-153, -4, 57, -80], [-109, 48, 19, -94, -131], [62, -16, -193, -185, -101, -124]]