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: 6, 6, ['V', '8015', 'N', 'O', 'Z', 'V', 'v']

Output: 0


Input: Consider Input: 8, 13, ['6413', 'n', 'z', 'T', 'R', 'Y', 'D', 'W', 'L', '521', '3411', 'B', 'O', '6757']

Output: 3932


Input: Consider Input: 9, 12, ['v', '8193', '2867', 'b', '8943', 'Q', 'C', '9827', 'F', 'i', 'c', '2333']


Output: 2333