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, 25, ['R', 'g', '5585', '1059', '3917', '8711', 'K', 'C', 'o', '4587', '7493', 'P', 'B', '5951', 'd', 'b', 'B', '851', 'S', '4589', 'P', '1471', 'Z', 'x', '9477']

Output: 53691


Input: Consider Input: 1, 17, ['4061', '8041', 'V', '5461', '8247', '3119', 'p', '5313', 'T', 'Z', 'D', '8837', 'B', 'a', '6441', 'O', '8311', 'Z', '473', '9', 'Q', 'E', '2957', 'W', '6263', '3917', '9775', 't']

Output: 57831


Input: Consider Input: 1, 2, ['3595', 'F']


Output: 3595