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]: 1, 2, ['9769', 'z', '6349', 't', '9391', '7181', '2405', 'j']
[EX A]: 9769

[EX Q]: 3, 9, ['H', 's', '7567', '9157', 'V', 'Y', 'h', '7045', 'y']
[EX A]:
23769