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:
7, 12, ['K', '5995', '5183', '67', '563', '9143', 'M', 'H', '2923', '1825', 'y', '373', 'm', 'w', 'x']

Ex Output:
5121


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:
9, 17, ['e', 'A', '5601', '9061', 'A', '9481', '4749', '2365', 'd', '1467', '6407', '4555', '719', 'p', '5017', 'I', 'e', '6967', '2263', '5569', 'V', 'Y', 'h']

Ex Output:

18165