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, 6, ['2277', 'k', 'S', '6367', 'q', '5455']

Output: 5455


Input: Consider Input: 1, 1, ['f', '6023', 'A', 'f', '4665', 'u', 'o', '7783', 'a', 'N', 'd', '7685', 'W', '9631', 'e', 'W', '1625', 'Q', 'B', '9097', '7613', 'L', '9929', '8469']

Output: 0


Input: Consider Input: 11, 13, ['3421', 'q', '5457', '4867', '4163', '9219', 'n', '9921', '5457', '3985', '3375', 'o', '1449', 'w', '1901', '6585', 'a', 'o', '8397', '2597', '7839', 'O']


Output: 4824