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]: 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]: 1, 5, ['O', 'T', 'V', '9035', 'L', 't', 'I']
[EX A]: 9035

[EX Q]: 3, 7, ['p', '2229', '6845', 'i', 'X', '2145', 'W', '3443', '4897', 'q']
[EX A]:
8990