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:
1, 7, ['u', 'Z', 'j', 'A', 'N', 's', 'h', '7331', '8259']

Ex Output:
0


Ex Input:
2, 7, ['C', 'C', '9639', '7815', 'N', '1713', '8339', '4237']

Ex Output:
27506


Ex Input:
2, 5, ['57', 'c', 'C', '7729', 'D', 'V', '3317', 'l', '4179', '1653', 'y', 'p', 'T', '5489', 'p', 'W', '8659', '8085', 'n', 'C', 'w', 'O', 'p', 'I', 'n']

Ex Output:

7729