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: 1, 2, ['9769', 'z', '6349', 't', '9391', '7181', '2405', 'j']
Example Output: 9769

Example Input: 5, 16, ['t', 'r', 'O', 'q', 'B', '6327', 'f', 'R', 'H', '4429', 'o', '5347', 'U', 'h', '7067', '237', 'i', 'k', 'K', '461', 'L', '4105', 'i', '6483']
Example Output: 23407

Example Input: 1, 3, ['7787', '4187', 'k', 'x', '427', 'z', '4681', 'C', 'M', 'g', 'i', 'i', '425', '4241']
Example Output:
11974