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.

[Q]: 12, 20, ['V', 'H', '5509', 'J', '887', '6361', '4273', '1017', '5167', 'G', 'g', '5185', '2617', 'h', 'Y', '7697', '5075', 'F', '2675', '29', 'K', '2081', 'R', '7011']
[A]: 23278


[Q]: 1, 2, ['4319', '3495']
[A]: 7814


[Q]: 7, 9, ['i', 'g', 'V', '3435', 'Q', 'I', '933', '2885', 'g', '6181', 'E']
[A]:
3818