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]: 14, 18, ['4235', 'd', '7915', '2595', '1123', '475', '7987', '287', '4659', '45', '737', 'l', 'Z', '5245', '8021', 'g', 'D', '9801', '2327', '339']
[A]: 23067


[Q]: 3, 6, ['d', 'v', 'd', '5043', '8989', 'w', 'Y']
[A]: 14032


[Q]: 3, 15, ['7147', 'i', '7895', '711', '7167', 'H', 'L', 'y', 'c', '8037', '1805', 'p', '8653', 'k', '4477', '4581', 'N', 'O']
[A]:
38745