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]: 3, 16, ['1165', 't', '4833', 'b', '6361', '1175', '3943', 'd', 'l', '7519', 'j', 'X', 'E', 'A', 'm', '6469', '9429', '2415', '5187', 'k', 'd', '9607', '1375', '8913', 'c', 'A', '9229']
[A]: 30300


[Q]: 1, 6, ['7349', 'S', '4839', 'R', '4443', '7569', '7307']
[A]: 24200


[Q]: 1, 2, ['219', 'J', '1443', 'I', 'V', 'j', 'K', 'n', '663', 'b', 'Q']
[A]:
219