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, 12, ['4439', 'P', 'e', '4929', '2085', 'w', 'C', '5385', '6517', 'w', '6257', '9721']
[EX A]: 29965

[EX Q]: 3, 6, ['w', 'V', '7413', '5027', 's', '7037', 'S', '763', 'D', 'U', 'x', 'l', '9331', 'S', 'k', '8369', 'D', 'A', 'e', 'A', 'r', '5113', '1367', '4197', 'm']
[EX A]: 19477

[EX Q]: 20, 29, ['q', 'S', '6517', '2311', 'z', '3789', 'S', 'M', 'b', '2525', 'E', 'M', 'J', '8665', 'b', '4039', 'Q', '7577', 'N', 'a', 'l', 'N', '7721', 'H', '6213', 'g', '757', 'z', '9783', '8805']
[EX A]:
24474