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, ['2977', 'i', 'l', 'r', '8835', '7697', 'p', '1685', 'h', 'N', 'Z', '8661', '6003', '7007', 'D', 'C']

Ex Output:
0


Ex Input:
2, 4, ['7815', '573', '8607', 'y', '6107', '9063', 'f']

Ex Output:
9180


Ex Input:
7, 15, ['L', '8233', '5711', 'A', '6833', 'l', 'Z', 'j', 'A', 'u', 'E', '3599', 'm', '7405', 'y', '5183', '8875', '5529', '6597', 'W', '2955', 'b', '9085', '1207', 'r']

Ex Output:

11004