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]: 4, 8, ['6669', 'G', 'y', '129', 'y', 'x', 'w', 'C', 'J']
[A]: 129


[Q]: 3, 18, ['h', 'x', '371', 'i', '8545', '7767', '5033', '1041', 'A', '4643', 'L', '187', '5017', 'x', 'R', '7891', '3919', '9721', '8625', '5817', 'D', '4825', 'S']
[A]: 54135


[Q]: 6, 8, ['L', '5769', 'O', 'U', '3243', '6169', 'S', 'p', 'm', 'g', '1211', '885', 'm', 'Z']
[A]:
6169