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:
2, 3, ['u', '7053', '303', '329', 'D']

Ex Output:
7356


Ex Input:
8, 9, ['6753', 'Y', 'v', '1365', '1033', 'l', 'A', '203', 'J', '8391', 'i', '1813', 'V', 'D', 'S', '4981', 'o']

Ex Output:
203


Ex Input:
13, 19, ['T', 'H', 'e', '9221', 'Y', '9931', '7515', '5223', '3829', '1595', 'E', 'N', '777', 'v', '3435', '1753', '407', 'F', '3721']

Ex Output:

10093