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.
[[-39, -146, 37, 97, -159, -124], [-141, -103, -195, 22], [41, -182, -22, -36, -117, -27], [-160, -16, -61, -132, 88, -93, -186], [-94, -18, -68, -180, -159, 8], [-185, -170, 75, -183, -132, -62, -34], [-88, 65, -72, -1, -121, -120], [27, -52, -66, -149, -56, 7, 38], [-110, -78]]