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, 4, ['7815', '573', '8607', 'y', '6107', '9063', 'f']
[EX A]: 9180

[EX Q]: 6, 27, ['O', '4985', '525', 'U', 'B', '4689', 'u', '2891', 'A', 'O', 'u', 'T', 'Z', '81', '9747', 'O', '2135', 'U', '8637', '3927', 'X', 'z', 'W', 'h', '6347', 'L', 'c', 'H', 'q']
[EX A]: 38454

[EX Q]: 1, 8, ['9163', 'W', 'n', 'K', '931', '5237', 'p', '4791', 'Y', '5627', '559', 'q', 'w', '9681', 'F', 'S', '8533']
[EX A]:
20122