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, 4, ['H', 'V', 'w', '4621', 'C', '3763', '1271', '967']
[EX A]: 4621

[EX Q]: 3, 10, ['r', 'A', 'l', '7169', '3249', 'T', 'O', 'g', 'F', 'M', 'R', '171', 'M', '2449', '3749', 'f']
[EX A]: 10418

[EX Q]: 7, 8, ['2985', 'R', 'C', 'J', '2599', 'W', '3311', '339', '5827', '6211', 'F', '115', '5899', '7801', '7263', 'D', 'B', 'Q', 'N']
[EX A]:
3650