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.
[[81, -14, -116, -3, -16, 51, -33], [-81, 76, 54], [-38, 17, -35, 59, 79, -186, -129], [-176, 16, -84, -16], [-111, -98, -51, 86, 20, 85], [-153, -15, -159], [17, 74, -81, -45, -10, -28], [-14, -172, 4, -140], [-8, -123, -178, 41]]