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: 2, 6, ['2495', '83', '1257', '9157', 'z', 'Y', '8689', '385', '747', '1175', 'j', 'U', 'k']

Output: 10497


Input: Consider Input: 10, 17, ['479', '9493', '9061', '5585', 's', '9653', '5741', '7451', '2141', '9547', 'r', 'Z', '8915', '8289', '9281', '561', 'J', '3029', '3595', '7279', '7641']

Output: 36593


Input: Consider Input: 8, 8, ['3993', '1123', 'h', '2271', '63', '3575', '6391', '7247', '1913', 'B', 'a', 'd', '61', 'S', 'W', 'v', 'z', 'j', '8933', 'Z', 'Q', 'W', 'D', 'D']


Output: 7247