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: 2, 5, ['r', 'Y', '3769', 'k', '6407', 'G', 'M']

Output: 10176


Input: Consider Input: 11, 16, ['z', '8383', '1663', '9983', '6575', '1633', 'D', '2105', '393', '4043', 'K', 'v', 'k', '4155', '5747', 'Q', 'Y', '965', '317', '4645', '5987', 'd']


Output: 9902