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.
[[-12, -68, 1], [-82, -196, -10, 84, 3], [2, -31, -195, -15, -189], [-60, -16, 63, -114], [81, 64, -120, -157, 76], [88, -39, -61, -37], [-48, -142, 59, 62, -6, 87, 19]]