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: 3, 4, ['9567', '9317', 'l', 'n', 'i', '6993', '2775', '2651', '1311', '2955', '6271', 'b', '7333', 'U', 'd', '6455', 'n', 'o', '1871', 'u']

Output: 0


Input: Consider Input: 10, 11, ['J', '5319', '1625', 'z', '275', 'B', '6901', 'b', 'X', '8669', '2307', '3117', 'K']

Output: 10976


Input: Consider Input: 2, 14, ['r', '4633', '201', 'T', 'Q', '5857', 'D', '4239', '2571', '6655', 'k', '5143', 't', '8037', '19', '1347', '1985', '3749', '7673', '9949', '2071', 'W', 'd', '1605', '515']


Output: 37336