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, ['j', 'j', 'W', '1351', 'B', 'e', '2585', '8831', '7465']

Output: 1351


Input: Consider Input: 4, 8, ['3753', 'y', '417', 'B', 'g', 'D', 'L', '6175']

Output: 6175


Input: Consider Input: 5, 9, ['1911', '4797', '2787', '273', '6191', '8979', '4315', 'K', 'l', '2681', '2889', '7785', '3021', '2301', '4445', 'f', 'g', '9253', '5429', 'x', '6167', '8277', 'E', '4659', 'g', 'j', '3639']


Output: 19485