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, 5, ['O', '4521', 'w', '6745', 'W', '7743', '4113', '7179', '9751', '2365', '9161', 'j', '1339', '6927']

Output: 11266


Input: Consider Input: 2, 3, ['9773', 'e', 'G', 'm', '1859']

Output: 0


Input: Consider Input: 1, 6, ['g', 't', 'X', '4965', '4267', 'y', 'm', 'U', 'b', 'P', '4607', '7437', '2451', 'J', '7651']


Output: 9232