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: 4, 10, ['1081', 'm', 'm', '489', '9481', '5741', '1049', 'p', 'd', '7785', 'm', '4905', '1343', 'A', '9931', 'C', 'v', 'l']

Output: 24545


Input: Consider Input: 2, 16, ['A', '4865', 'X', 'p', '8287', '5909', 'o', 'j', '333', '9551', '7351', '3377', 'B', 'P', '9329', '77', 's', '5269']


Output: 49079