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: 5, 11, ['9535', 'L', '5957', 'm', 'B', 'W', '2105', '4959', 'f', '395', 'a', 'W', 'C']
Example Output: 7459

Example Input: 2, 7, ['3295', '2909', '8081', '8299', '8979', 'J', 'V', 'r', '2403', '5589', '6875', '9181', '6547', 'k', 'n']
Example Output: 28268

Example Input: 10, 20, ['6495', '4633', 'V', 'q', 'V', 'O', 'E', 'E', '1177', '3821', 'G', '579', 'p', '6497', '6599', 'b', 'N', 'H', 'A', '9191', '2905', 't', 'V', '5807', '9013', 'j', 'G', '1465', 'r']
Example Output:
26687