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, 10, ['9653', '3845', 'm', 'K', 'j', '5041', 'W', 's', 'j', 'A', 'G']
[A]: 8886


[Q]: 1, 1, ['d', '6481']
[A]: 0


[Q]: 14, 25, ['t', 'k', '6985', '5297', '6391', 'c', '5395', 'G', '7409', 'y', '19', 'D', 't', 'p', 'i', 'W', 'F', 'p', '4885', '6719', '9575', '7561', '4051', '9345', '1723', 'y', 'f']
[A]:
43859