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.
[[-63, 31, -16, 36, -35], [-33, -36, 90, 27, -130, -137, -164], [-108, -171, -50, -112, -136, -116], [-58, -123, 52, -73, -65, -35, -87], [-170, 10, -143], [-95, 98], [-57, 72, 38, 57], [-37, 70, 8, -171]]