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.

[EX Q]: 1, 10, ['9139', 'F', 'e', 'F', '8979', '831', '6811', '3677', '2937', '1001']
[EX A]: 33375

[EX Q]: 1, 10, ['H', 'P', '1985', '1797', '9115', 'V', 'o', '2405', '7817', 't', 'C']
[EX A]: 23119

[EX Q]: 8, 12, ['i', '35', 'v', 'G', 'o', '5861', '8371', 'P', '1895', '6183', '8025', '2455', '4763', '409', 'e', 'A', '9029', 'a', 'I', '2761', '5481', 'f', '3413', '803', 'W', 'A', '8781']
[EX A]:
18558