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: 3, 5, ['3515', '4581', '8863', '2037', '7899', 'N']
Example Output: 18799

Example Input: 3, 17, ['T', 'j', '9425', '2255', '8915', '7957', 'U', '5987', '9461', 'A', 'g', 'n', 'F', '637', '475', 't', 'y']
Example Output: 45112

Example Input: 3, 15, ['1259', 'h', '7705', '1883', '2053', '9063', 'J', 'y', 'g', 'h', 'X', 'n', 'D', '6487', '9291', 'Z', 'R', 'P', '1981', '7927', 'A', '9083', 'I', '2011', '7109', '9703', 't', 's']
Example Output:
36482