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.
[[14, -123, 15, -192, -176, 42], [-100, 59, -84, 48, 20, -143, 59], [-117, 3, 70], [-158, -20, -84, -134, -194, -7, 13], [11, -107, 77, -187, -30, -128, -68], [-41, 42, -138, 70, -181, -180], [0, -94, 61, -102, -119, 3, 82], [85, -154, -40, -133, -63, 83, 77], [-134, 28, 99, 3, -136]]