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, 8, ['s', 'X', 'a', 'L', 'N', 'J', '1893', '4909', '349', '7679', '4479', 'i', '7345']
Example Output: 6802

Example Input: 5, 9, ['r', 'P', 'r', 'g', '5077', 'T', '2819', 'f', 'p', '6449', '8509', '8915', 'I', 'Z', 'N', '8657', 'R', '3739']
Example Output: 7896

Example Input: 6, 22, ['b', 'n', 'z', 'f', '5569', '4489', 'Y', '5441', 'b', '6605', '1797', '1617', '3987', 'd', '199', '9389', 'U', 'F', 'F', 's', 'u', 'D', 's', 'a', 'V', '4731', '8367']
Example Output:
33524