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, 11, ['q', 'q', 'P', '4335', 'l', 'k', 'D', 'R', '719', 'g', '855', 'l', '6639', '7935', '8407', 'A', 'H', '8357', '759', 'i', '1205', 'B', 'Q', 'V', '359', '4565', '9975', 'g', 'h', '9585']

Ex Output:
5909


Ex Input:
2, 2, ['5189', 'J']

Ex Output:
0


Ex Input:
11, 18, ['s', 'K', 'B', 'W', 'T', '67', '6235', 'M', 'a', '9315', 'l', '1141', '8569', 'p', 'b', '2933', 's', '5895', '3441', 'A', 'n', '7749', '4423', 'i', '5655', '8637', 'F', 'o', 'X']

Ex Output:

18538