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]: 2, 6, ['2495', '83', '1257', '9157', 'z', 'Y', '8689', '385', '747', '1175', 'j', 'U', 'k']
[A]: 10497


[Q]: 5, 23, ['6187', 'j', '9129', 'n', 'D', '6181', 'H', 'c', 'V', 'w', '4481', '9115', '1067', 'H', 'a', '1421', '7129', 'S', 'D', '6027', '8845', '3827', 'L']
[A]: 48093


[Q]: 14, 29, ['9575', '9349', 'r', '6411', 'W', '1211', 'h', '4817', 't', 'D', '9917', 'l', '5791', 'F', '1295', '1835', '5131', '7811', '9055', 'O', '3015', '6881', 'y', '2151', 'O', '6167', 't', '111', 's', '1149']
[A]:
43452