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:
7, 9, ['6409', '7805', '2757', 'A', '8949', '449', 'N', 'M', '9511', 'v', '6085', '1101', '4995', 'B', '6039', '295', '5459', '4211', 't', '3415']

Ex Output:
9511


Ex Input:
1, 2, ['t', '9343', 'g']

Ex Output:
9343


Ex Input:
7, 15, ['9755', '3639', 't', 'N', '539', '4133', '7557', '8753', '335', 'P', 'a', '3123', 'P', '3907', '541', 'c', 'I', 'L']

Ex Output:

24216