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: 4, 5, ['b', 'u', '5279', '6945', '6631']

Output: 13576


Input: Consider Input: 5, 11, ['5641', 'c', 'z', '5969', 'w', '9149', 'r', 'B', 'y', '3315', 'M', '8087', 'j', '1159', '9365', 'b', 'a', 'y', '6957', '5735', '9739', '133', 'm', '4887']

Output: 12464


Input: Consider Input: 2, 5, ['3273', '3583', 'q', '1589', 'H', 'W', 'Z', 'o', '2641', '195']


Output: 5172