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]: 3, 16, ['T', 'v', '2985', 'F', '8921', 'M', 'F', '4243', 'k', 'x', '435', 'B', '3335', '7613', 'M', '7809', 'q', '4147', 'h', '7523', 'R', '7589', '8795', 'O', 'L', '3371']
[EX A]: 35341

[EX Q]: 2, 8, ['3651', '6881', '3701', 'M', '8543', '5995', 'q', 'A', 'S', '745']
[EX A]: 25120

[EX Q]: 15, 17, ['J', '1801', 'S', 'C', '5197', '8819', 'W', 'S', '1469', '5705', '5733', '7497', 'Z', '3219', '3557', 'i', 'M', 'Y', 'm']
[EX A]:
3557