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.
[[35, -93, -67], [-110, 22, 11, -103, 51, -138, -99], [93, -85, 76, 62, -144, 86, -45], [-22, -117, 32], [17, -8], [-159, -25, -120, -119, 99, -127, -17], [-119, -159], [86, -50, -36, -134, -24, -85, -165], [-142, -56, -35, 81, 93, 34, -176]]