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.
[[-70, 81], [-137, -144, 89, 42], [85, 21, -19], [-147, -65, 80, -78, 43], [76, -26, 59, 38, -116, -61, -164], [-183, -175, -113, -144, 28, 56, -33], [52, 25, 48], [50, -27, -55], [-145, -138, -162, -48, -41, -43, -151]]