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, 5, ['9153', 'S', '605', '2951', 'I', 'o', '4995', '2895']
[EX A]: 3556

[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]: 3, 13, ['C', 'a', 'Y', '7395', '8883', '3931', '6297', 'a', '5199', '4435', 'O', 'R', '1897', 'g', 'y', 'E', '87']
[EX A]:
38037