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, 24, ['2767', '5843', '2707', '2337', '6373', '1267', 'T', 'l', 'N', 'T', 'Z', 'Y', '699', '8411', 'L', '3983', '9083', '4929', '3757', 'R', '2281', '3547', '9079', 'R', '787']
Example Output: 45769

Example Input: 3, 4, ['6203', 'g', '471', 'j', 'o', '9679', 'M', '5459', 'y', '1929', '1649', 'C']
Example Output: 471

Example Input: 2, 3, ['h', 'w', '3397']
Example Output:
3397