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.
[[-139, -128, -158], [12, 6, -153, -132, 78, 18, -147], [-196, -169, -58], [-9, -155, -58, 95, 72], [-106, 44, 89, -49, -160], [-50, -78, -97, -165], [-169, -90, -145, -180, -10, 39, -191], [-106, -81, 57, -122, -14, -64]]