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: 5, 8, ['j', '1099', 'J', 'l', 'E', '6559', '6181', '4441']

Output: 17181


Input: Consider Input: 1, 5, ['V', '9481', '9901', '7235', '5281', '2719']

Output: 31898


Input: Consider Input: 1, 7, ['1427', 'W', '1631', 'x', 't', '7351', '661', '2481', '3881', 'd', '2223', '4495', 'g', 'b', '7195', '6535', 'S', '3369', '7579']


Output: 11070