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.
[[79, -119, 57, 25, -160, -60], [90, -153, 38, 43], [-88, -179, -96, 61, 14, -130, -42], [41, -89, -132, -31], [-66, -18, 76], [-148, 76, -171, -103, -73]]