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:
5, 6, ['2277', 'k', 'S', '6367', 'q', '5455']

Ex Output:
5455


Ex Input:
5, 12, ['2653', 'A', '4739', '149', 'J', '817', 'n', '9589', '965', '1545', 'r', '9061', '7973', '5769', 'Y', '5889', 'A', 'P', '5789', '9757']

Ex Output:
21977


Ex Input:
9, 10, ['r', '9439', 'W', 'S', 'R', 'Z', 'g', '8087', '2703', '5063', '3135', '8171', 'O', '27', 'N', 't', '3369', 'U', '447', '5513', 'F', '7951', 'U', '2723', 'A', 'I', 'H', 'b', 'Q']

Ex Output:

7766