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:
4, 18, ['b', 'K', 'Z', '8757', '691', '8915', 'l', '2819', '9599', '4149', '8791', '7815', '7211', '1973', 'w', '5557', '1071', '2483', '9851', 'x', '5441', '2787', '3723', '5981', 'o', '1045', 'z']

Ex Output:
69831


Ex Input:
19, 21, ['y', '9403', 'C', '389', '5521', '9271', 'W', 'B', '3613', 'w', '2741', 'H', '8305', '727', '7641', '5857', '9183', '1297', 'p', '7371', 'b']

Ex Output:
7371


Ex Input:
8, 11, ['7243', 'u', '2545', '3583', '8701', 'D', 'a', 'e', '1069', 'Q', 'z', 'e', 'W']

Ex Output:

1069