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, 2, ['8895', 't', '5739']

Output: 8895


Input: Consider Input: 4, 12, ['E', '6343', 'f', '541', '7361', '9993', 'g', '3185', 's', 'w', 'Q', 'I', 'e', 's']

Output: 21080


Input: Consider Input: 10, 12, ['7247', '8557', 'I', '6131', '9083', '869', 'Y', '7571', '5747', 'I', '8689', 'O', 'x', '7813']


Output: 8689