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, 9, ['7111', '835', 'W', '6975', '4459', 'B', 'B', 'Z', 'o']
Example Output: 12269

Example Input: 1, 7, ['Y', 'n', '8993', 'X', '7211', 's', 't', 'R', 'm', 'L', '9559', 'K', 'j', '791']
Example Output: 16204

Example Input: 12, 15, ['j', 'Z', 't', '8633', '5177', 'X', 'C', 'S', 'C', '8127', 'F', '9009', 'k', '3519', 's', '3467']
Example Output:
12528