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: 6, 13, ['Z', 'h', 'j', 'i', '4335', 'c', 'A', 'O', 'U', '8173', 'N', 'E', '9187', '9911']
Example Output: 17360

Example Input: 3, 6, ['x', '7739', '1923', '5829', '2215', 'M', '1901', 'A', '1585', 'W', '2433', '8947', '2217', '7879', 'i', '8543', '7457']
Example Output: 9967

Example Input: 2, 3, ['m', 'f', '9879']
Example Output:
9879