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: 8, 30, ['5585', '6253', '4067', '2991', '1809', 'y', '8803', 'e', 'T', '695', 'b', '8257', '6427', 'm', '2647', '2207', '3241', '3379', 'L', 'B', 'X', 'R', 'v', 'P', '3989', 'n', 'U', '6143', 'N', 'Y']
Example Output: 36985

Example Input: 12, 15, ['s', 'J', '2419', '3329', 'z', 'p', 'V', 'J', '3477', 't', 'L', 'r', '8983', '6035', 'M', '3697', '3675', 'o', '2103', '6837', 'm', 'E', 'R', 'S', 'c', '3011']
Example Output:
15018