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, 6, ['x', 't', '9767', '4787', 'T', 'e', 'Y', '8919']
[EX A]: 0

[EX Q]: 7, 12, ['3713', 'N', '7191', '73', '4595', '6537', 'H', 'v', 'H', '8531', 'k', 'H', 's', 'x', 'R', 'd', '507', 'C', '9649', '8875', '7931']
[EX A]: 8531

[EX Q]: 5, 9, ['I', '3889', '9427', 'n', '6709', 'n', '3335', 'm', '5679', '4785', '6983', 'm', 'F']
[EX A]:
15723