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:
3, 4, ['2879', '5161', 'v', 'c', 'P', 'T', 'p', '6905', 'F']

Ex Output:
0


Ex Input:
9, 12, ['4189', '4575', 'i', 'e', 'Y', '5595', 'U', 'M', 'b', 'n', '5347', 'v', 'w', 'Z', 'F', '503', 'G', '4429', '3087', '295', 'W']

Ex Output:
5347


Ex Input:
4, 10, ['255', 'R', '4421', 'd', '6955', '3683', 'l', 'j', 'L', 'L', '8997']

Ex Output:

10638