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.

Input: Consider Input: 5, 8, ['3017', '2471', 'r', 'M', '8213', '4259', '8397', 'A', '9809', '5827', '4079', 'v', '6735', 'T', 'n', '3877', '9777', '1395', '9631']

Output: 20869


Input: Consider Input: 3, 4, ['u', '5041', 'E', 'U', 'a', 'd']

Output: 0


Input: Consider Input: 2, 17, ['t', 'f', '2813', 'B', '2877', 'z', '4007', 'b', 'H', '479', 'W', 'Q', 'z', '3289', 'g', '5237', '4397', '123', '5487', '891', '6111', 'V', 'B']


Output: 23099