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.
[[27, -6, -147, -197, -105], [-199, 51, 41, -61, 50, 16], [29, -75, 6, -30, -77, -18], [27, -88, -22, -152, -26, -80, -9], [-17, -35, -88, -52, -38, -72], [72, -191], [-58, 48, -53, -27], [-66, 0, -144, 93], [-162, 19, -171, -112, 57, 22]]