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: 3, 7, ['k', 'm', 'W', '641', 'X', 'B', '897']
Example Output: 1538

Example Input: 2, 4, ['7815', '573', '8607', 'y', '6107', '9063', 'f']
Example Output: 9180

Example Input: 5, 20, ['z', 'z', 't', 'T', 'e', 'F', '65', 'H', '2121', '2311', '8035', 'h', 'W', 'n', '8857', 'O', '3471', '9365', '3939', '481', 'N', 'N']
Example Output:
38645