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: 16, 16, ['V', '9929', 'S', 'g', '1751', 'd', 'G', 't', '9289', '6139', 'J', 'T', 'W', '8085', '7747', 'j', '5657', '8875']
Example Output: 0

Example Input: 3, 5, ['i', 'e', '6583', '313', '5511']
Example Output: 12407

Example Input: 4, 7, ['9883', '1963', 'C', '1487', 'z', 'T', 'I', 'h', 'a', 't', 'e', '8435', 'M', '1289', '367', 'u', '3473', 'l', 'h', 'w', '9557', '8465', '4543', '6801', '6491', 'N', '9187', 'k']
Example Output:
1487