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]: 6, 13, ['Z', 'h', 'j', 'i', '4335', 'c', 'A', 'O', 'U', '8173', 'N', 'E', '9187', '9911']
[EX A]: 17360

[EX Q]: 4, 5, ['677', '5585', 'W', 'J', 'C']
[EX A]: 0

[EX Q]: 2, 4, ['9103', '5105', '5031', '5487']
[EX A]:
15623