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.
[[-119, 19], [7, -192, -79, -165, -28], [62, -112, -174, -72, 74], [-136, 13, -200, -91, -104, -68], [13, 0, -94, -142], [0, -56, -191], [72, -80, 36], [-123, -38, 100, -92, -56, -168, -122], [19, 22, 58, 97]]