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: 7, 9, ['6409', '7805', '2757', 'A', '8949', '449', 'N', 'M', '9511', 'v', '6085', '1101', '4995', 'B', '6039', '295', '5459', '4211', 't', '3415']
Example Output: 9511

Example Input: 2, 2, ['9797', '5585', '1849', '4485', '9225']
Example Output: 5585

Example Input: 3, 3, ['13', 'c', '5607', 'P', '8527', 'u', '2697']
Example Output:
5607