Insertion Sort in Python3.6
Looks good to me. It's simple and easy to read. The only nit I might have:

l = i + 1
for j in range(l, -1, -1):


could be:

for j in range(i + 1, -1, -1):


since it doesn't look like you're using l anywhere else.