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.

Ex Input:
9, 11, ['8449', 'j', '8735', '2839', '2773', '1659', 'V', 'I', 'x', 'V', 't', '7837', 'F', 'N', '4179', 'G', 'f', '8193']

Ex Output:
0


Ex Input:
2, 19, ['u', 'x', '1103', 'K', 'N', 'o', '1943', 'Z', 'r', 'B', 'N', 'e', '7289', 'S', '325', 'G', 'x', 'D', '9005', 'y', '1729', '961', '4621', 'D', 'u', '1235']

Ex Output:
19665


Ex Input:
4, 4, ['Y', 'n', 'X', 'o']

Ex Output:

0