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: 2, 3, ['9191', 'D', '1937', 'N', 'g', '3485', '7327']
Example Output: 1937

Example Input: 8, 14, ['i', '2929', '9353', 'T', '5451', 'n', 'y', '2861', 's', 'G', '7717', '3833', '3753', 'u', 'E', 'T', 'I']
Example Output: 18164

Example Input: 1, 4, ['Q', '6877', 'L', 'f', '503', 'g', 'L', '9']
Example Output:
6877