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.
[[-101, -64], [-17, -164], [-153, -106, 39, -133, 11, -25], [15, -158, -185], [-94, -139, -191, -5, 39, 83, -156], [35, 43], [-55, 66, -18, 55, -132], [-126, 77, -189, -52, -121], [-77, -99]]