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, ['x', 's', '1415', '6003', '2237', 'g', 'l', 'a', 'l', 'y', 'y', '4651', 'e', 'D', 'g']
Example Output: 0

Example Input: 3, 5, ['7639', '7477', '2545', '6847', 'N', 'H']
Example Output: 9392

Example Input: 2, 8, ['8929', '1857', '7069', '77', '3751', 'm', 'A', 'H', 'I', 'B', 'g', 'F', 'z', 'G']
Example Output:
12754