In this task, you are given inputs i,j, and A, where i and j are integers and A is a list. You need to return the sum of all the numerical elements in the list A between the positions i and j (including positions i and j). Return 0 if no numerical element is present in the list between the given ranges. i and j will be non-negative, and will always have a value less than the length of A. i will always be less than j.

4, 8, ['6669', 'G', 'y', '129', 'y', 'x', 'w', 'C', 'J']
129

7, 15, ['1769', 'c', '7895', '8687', '985', '7559', '1109', 'X', 'z', '2309', 'D', 'P', '8655', 'I', 'u', 'z', '9639', '83', '7631']
12073

1, 2, ['6361', '4733', '8549', '4491', '7831', '1767', '139', 'C', '2105']

11094