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, 2, ['8149', '7123', 'c', 'X', '1659']
[EX A]: 7123

[EX Q]: 25, 27, ['6411', '2467', 'y', '4973', 'C', '8853', 'H', 'G', 'a', 'N', '3759', '7803', '5403', 'Z', '4047', '6283', 'v', '5437', 'p', 't', 'S', '7605', 's', 'Z', '7537', 'Y', 'U', 'W', '2147', 'K']
[EX A]: 7537

[EX Q]: 5, 13, ['2083', '9451', '2921', 'F', '3981', '6855', 'm', '3099', 'N', 'b', 'a', '2531', '4051', 'h', '8215', 'z']
[EX A]:
20517