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]: 1, 7, ['v', '8881', '2711', '7569', 'C', '6117', '1569', '1257', 'h', '5407']
[A]: 26847


[Q]: 7, 9, ['6409', '7805', '2757', 'A', '8949', '449', 'N', 'M', '9511', 'v', '6085', '1101', '4995', 'B', '6039', '295', '5459', '4211', 't', '3415']
[A]: 9511


[Q]: 3, 5, ['P', 'E', '5065', 'h', 'z', 'C', '3379', '9669', '1925', 'c', 'q', '6047', '7531', '4943', '8099', 'S', 'k', '2109', '1479', 'I', 'U', 'H']
[A]:
5065