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, 1, ['1449', '1257']
[EX A]: 1449

[EX Q]: 9, 12, ['6001', '6723', '1813', 'S', '3331', 'T', '297', '8105', '7529', 'f', '1459', '323', '8077', 'N', 'W', 'G', 's', 'z', '7559', 't', 'F', 'h', '3771', '975']
[EX A]: 9311

[EX Q]: 1, 9, ['9281', '6899', '5049', 'v', 'y', '3055', 'f', '4219', 'q', '1647', 'C', 'd']
[EX A]:
28503