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.
[[-44, 36, -87], [-156, -37, 60], [11, -144, -45, -13], [30, -94, -197, 6, -130], [1, 16, 81], [83, 80, -170, -37, -35], [23, -38, -100, -125, -81, 43, -18], [60, -153]]