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: 8, 9, ['P', 'V', '5567', 'm', 'V', '9533', '2381', '1095', '835', 'B', 'z', 'J', 'H', 't', 'b', 'z', 'e']
Example Output: 1930

Example Input: 5, 11, ['5641', 'c', 'z', '5969', 'w', '9149', 'r', 'B', 'y', '3315', 'M', '8087', 'j', '1159', '9365', 'b', 'a', 'y', '6957', '5735', '9739', '133', 'm', '4887']
Example Output: 12464

Example Input: 12, 13, ['i', 'M', 't', 'D', 'R', '581', '2765', 'G', '4317', 'y', 's', 'w', '4645', 'V', 'G', '7569', '5935', '7361', '1661', '2513', '6483', 'W', '6527', '1561', '7385', 'w']
Example Output:
4645