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: 1, 2, ['E', 'z']
Example Output: 0

Example Input: 23, 25, ['v', 'J', 'B', 'y', 'G', 'z', 'f', '1651', 'T', 'X', '8701', '701', 'T', 'V', '1037', '4095', '8297', '2733', 'P', 'J', '7759', 'Z', '8153', 'q', '7619']
Example Output: 15772

Example Input: 7, 21, ['x', 'k', 's', 'z', 'z', '8887', 'W', 'v', 'X', 'j', 'w', '8239', 'o', '833', '4433', 'k', '7941', '7233', 'J', 'r', 'w', 'E', '2453', 'g']
Example Output:
28679