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.

Example Input: 2, 6, ['2495', '83', '1257', '9157', 'z', 'Y', '8689', '385', '747', '1175', 'j', 'U', 'k']
Example Output: 10497

Example Input: 4, 7, ['6307', 'N', '5209', 'M', 'k', 'd', '6933']
Example Output: 6933

Example Input: 1, 2, ['8221', '209', 'b', 'c', '7519', 'S', 'X', 'w', 'o', '6005', '9093', 'X', 'T', '4109', '7951', 'M', 'R', '995', 'm', '9051', '1563', 'b', 'O']
Example Output:
8430