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]: 5, 6, ['937', '3595', '1279', '8705', '3587', '5879']
[EX A]: 9466

[EX Q]: 4, 12, ['E', '6343', 'f', '541', '7361', '9993', 'g', '3185', 's', 'w', 'Q', 'I', 'e', 's']
[EX A]: 21080

[EX Q]: 14, 30, ['793', '1245', '7729', 'Z', 'h', 'q', 'E', '2091', 'z', 'Q', 'Z', 'A', 'm', '4817', '9255', '587', '1113', '4107', '3109', '4435', '1199', '8075', 'c', '8123', '7567', 'g', '1807', '9571', '4739', '9967']
[EX A]:
78471