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]: 2, 8, ['6901', '3901', '5101', '4297', '1099', 'q', 'z', '6615', 'z', '6859']
[EX A]: 21013

[EX Q]: 2, 10, ['1711', '201', '6463', 'J', 'z', 'D', 'I', 's', '2161', 'I', '2479', '4475', '2519', '7511']
[EX A]: 8825

[EX Q]: 4, 10, ['9829', 'O', '4157', 'G', 'T', '7897', '6321', 'H', 'S', '4887']
[EX A]:
19105