Как оптимизировать по памяти решение по сортировке дуг графа?

    n, m = list(map(int, input().split()))
    f = [input().split() + [i + 1] for i in range(m)]
    for i in sorted(f, key=lambda x: int(x[2])):
        print(i[0], i[1], i[2], i[3])

def f():
    n, m = map(int, input().split())
    lst = [input().split() + [i] for i in range(1, m + 1)]
    lst.sort(key=lambda i: int(i[2]))
    for i in lst:
        print(*i)

>>> def f():
...     n, m = map(int, input().split())
...     lst = [input().split() + [i] for i in range(1, m + 1)]
...     lst.sort(key=lambda i: int(i[2]))
...     for i in lst:
...         print(*i)
... 
>>> f()
3 4
3 2 4
3 1 8
1 2 14
1 3 2
1 3 2 4
3 2 4 1
3 1 8 2
1 2 14 3
>>>

>>> import operator
>>> 
>>> def f():
...     n, m = map(int, input().split())
...     lst = [tuple(map(int, input().split())) + (i,) for i in range(1, m + 1)]
...     lst.sort(key=operator.itemgetter(2))
...     for i in lst:
...         print(*i)
... 
>>> f()
3 4
3 2 4
3 1 8
1 2 14
1 3 2
1 3 2 4
3 2 4 1
3 1 8 2
1 2 14 3
>>>

print(*i)

>>> print(*'abc')
  File "<stdin>", line 1
    print(*'abc')
          ^
SyntaxError: invalid syntax
>>>

import sys
import random
arr = [tuple(random.randrange(1000000000) for i in range(4)) for j in range(123456)]
size = 0
for i in arr:
    size += sys.getsizeof(i)
print(size)