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: 1, 6, ['1529', '2989', 'T', '8059', 'f', 'j', 'x', '2209']

Output: 12577


Input: Consider Input: 3, 15, ['8815', 'w', '5613', 'm', '9515', '9741', 'O', 'U', '7197', '5237', 'M', '9899', '8289', 'l', '3', '9313', '4467', 'K', 'k', '637']

Output: 55494


Input: Consider Input: 1, 8, ['N', 'N', '541', 'h', '9203', '7229', '9411', 'g', '4179', '9825', 'U']


Output: 26384