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: 3, 5, ['i', 'e', '6583', '313', '5511']

Output: 12407


Input: Consider Input: 6, 16, ['4469', '9515', 'z', '153', '123', '787', '3795', '1737', '6047', 'l', '165', 'C', 'p', '5221', 'M', '4149', 'L']

Output: 21901


Input: Consider Input: 2, 4, ['9055', '583', 'N', '3453', '2729', '2597', 'a', 'T', 'c', '2099', 'p', 'd', 'w']


Output: 4036