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]: 6, 13, ['x', '8293', 'W', 'O', '511', 'y', '9801', '7925', '3353', 'J', 'D', 'J', 'B', '2559', 'j']
[EX A]: 21079

[EX Q]: 5, 21, ['f', 'c', 'y', '1711', '3261', 'I', '3249', 'O', '7875', 'm', '7665', '375', 'V', '4561', 'v', 'J', '2809', '2081', 'i', 'v', 'S', 'f', '8393', 'P', 'r', '4103', 'q', '1141', '9971', '671']
[EX A]: 31876

[EX Q]: 18, 24, ['5967', 'f', '2899', '8323', 'O', '9351', 'B', 'L', 'B', 'r', '9989', '4355', 't', 'U', 'V', 'D', 'C', 'P', '8593', '4347', 'F', 'L', '6113', '1819']
[EX A]:
20872