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.

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

1, 6, ['237', 'x', 'Q', 'J', '4629', 'q', '2831', 'i', 'm']
4866

8, 8, ['u', 'J', 'n', 'y', 'r', 'T', 'Q', '9485', '4611', 'R', 'k', 'V', '5665']

9485