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, 6, ['a', '9091', 'I', '4849', 'O', '2435', 'v']

Ex Output:
16375


Ex Input:
1, 2, ['4001', 'e', 'm', 'Q', 'T', 'a', '2909', '4043', 'O', 'L', '3401', 'Y', '4015', '2045', '3881', 'd']

Ex Output:
4001


Ex Input:
2, 26, ['Y', 'F', '1947', '1601', '397', '9615', '2091', '8971', '403', 'C', '3993', '701', '4503', '8205', 'b', 'E', 'F', 'H', 'C', 'Y', '821', 'a', '6887', 'z', '8389', '4449', '437']

Ex Output:

62973