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, ['o', 'p', '4765', 'u', '629', 'p']

Ex Output:
4765


Ex Input:
2, 6, ['2495', '83', '1257', '9157', 'z', 'Y', '8689', '385', '747', '1175', 'j', 'U', 'k']

Ex Output:
10497


Ex Input:
8, 18, ['i', '3779', '1567', '8759', '625', 'D', '8819', 'A', 'n', 'O', 'e', 'D', '6605', '2059', 'c', '4723', 'd', 'z', 'u', 'b', '3625', 'x', '1737', 'n', 'v', 'q', '5467']

Ex Output:

13387