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, 17, ['J', '505', '9301', '6263', 'W', '901', '1441', '595', '7877', '4597', '409', 'j', 'Y', 'P', '4737', 'f', 'H', 'u', 'B', 'V', '6661', 'e']
[EX A]: 36626

[EX Q]: 2, 2, ['8149', '7123', 'c', 'X', '1659']
[EX A]: 7123

[EX Q]: 10, 23, ['B', '1851', 'j', '1689', 'd', '7797', '6003', '4739', 'y', 'l', '677', '8799', '7609', '9979', '4647', '2767', 'U', 'w', '2473', '9', '205', '7327', 'b', 'r', '769', 'I', 'q', 'E', '201']
[EX A]:
44492