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.
[[46, -35, -165, -41, 85, -86, 82], [-159, -56, -181], [-91, -188, 68, 49, -170, -149, -142], [-63, 73, -65, -12, -114], [-53, -109, -132, -63, -32], [-100, -54, -42, -12, -126], [-187, 16, -51, -153, 1]]