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:
11, 14, ['H', '4643', 'k', '9583', 'K', '3497', 'Q', '8111', '1837', 'Z', '6885', 'L', '1759', '7777', '3137']

Ex Output:
16421


Ex Input:
1, 3, ['b', '3997', '285', 'T']

Ex Output:
4282


Ex Input:
13, 28, ['N', '6363', 'u', '1533', '6031', '9257', '7821', 'M', 'm', 'j', '7199', 'y', 'e', '5889', 't', '9339', '3767', '8029', '1687', '5335', '6545', '1073', 'G', 'N', 'M', 'x', 'h', 'z', 'i', 'P']

Ex Output:

41664