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, ['F', 'u', '4899', 'P', '2029', 'A', '9641', '8201', 'e', 'g', 'Y', '3483', 'y', '6515', 'S']
[EX A]: 2029

[EX Q]: 12, 18, ['9047', '1191', '7027', 'b', '1877', 'n', '337', 'n', 'o', '9007', 'd', 'F', '4929', '2707', 'B', 'y', 'o', '2859', '1609', 'N', 'w', 'H']
[EX A]: 10495

[EX Q]: 10, 12, ['c', '8151', 'R', '5397', '2899', 'h', 'O', 'i', '5993', 't', '5733', 's', 'l', '2841', 'd', '2117', '9087', 'i', 'a', 'U', 'H', '4943', '9501', '9987', '7747', '527', 'm', '7363']
[EX A]:
5733