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, ['937', '3595', '1279', '8705', '3587', '5879']
[EX A]: 9466

[EX Q]: 7, 19, ['8309', 'O', '1491', 'k', '2521', '1161', 'y', '3215', '8345', '1949', '9883', 'g', 'z', 'B', 'S', 'j', 't', '2841', 'j', '3333', 'S', 'w', '2283', '793', 'w', 'q', 'p', 'J', '7979']
[EX A]: 26233

[EX Q]: 16, 17, ['1961', 'M', '6249', '5877', 'y', '6477', '8351', 'Q', '1', '4259', 'y', 'N', '8979', '1601', '3153', '3879', 'H']
[EX A]:
3879