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: 3, 4, ['v', 't', '4357', '1303']

Output: 5660


Input: Consider Input: 1, 7, ['u', 'Z', 'j', 'A', 'N', 's', 'h', '7331', '8259']

Output: 0


Input: Consider Input: 3, 8, ['d', '7311', '5471', 'R', '8837', '5057', '2647', '4431', '9557', 'T', '793', 'B', '2711', 'T', '57', '9169', '4197', '4983', '5717', 'W']


Output: 26443