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, 8, ['3017', '2471', 'r', 'M', '8213', '4259', '8397', 'A', '9809', '5827', '4079', 'v', '6735', 'T', 'n', '3877', '9777', '1395', '9631']
Example Output: 20869

Example Input: 6, 11, ['m', '455', 'u', 'C', 'b', 'N', 'A', 'W', 'M', '3811', 'K', '657', 's', '2839', 'E', 'E', '2733', '6733', 'c', 'P', 'V']
Example Output: 3811

Example Input: 3, 20, ['4137', '111', '9027', '3641', '1393', 'q', '1933', 'S', 'e', '4333', '4277', 'd', 'D', 'h', 'u', '9705', 'r', 'Y', 'r', '3285', '585', 'w', 'C', '8705', '2035', 'i', '8621', 'H', 'G']
Example Output:
37594