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.
[[-195, -60, -136, 39], [-167, 83, -39, -119, -94, -70], [-118, -105, -167, -2, 69], [81, -178, 50], [-192, 79, -78, -35], [0, 24], [91, 72, -72, 80, 69, -36], [-127, -21, -178, -45, -169, -174, -191], [-193, -20, -140, 18, -192, -192]]