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]: 13, 14, ['5297', 'V', '7495', '6967', 'b', 'w', 'a', '2403', 'V', 'n', '525', 'd', 'o', 'm', '3439', '4245', '6381', '5743', 'P', '1047']
[A]: 0


[Q]: 1, 3, ['5437', '8521', '9081', 'h', '5453', '5065', '2949', 'P', 'Q', '2853', '7857', 'l', '5217', 'O', 'V', '3585', 't', '2593', 'V']
[A]: 23039


[Q]: 7, 18, ['7415', '2973', '1751', 'D', '9765', '2923', 'P', 'U', 'b', '145', '569', '71', '8085', '4115', '9769', '3925', '7437', 'p', 'h', 'Z', '7125', 'i', 'M', 'z']
[A]:
34116