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.

Input: Consider Input: 7, 12, ['K', '5995', '5183', '67', '563', '9143', 'M', 'H', '2923', '1825', 'y', '373', 'm', 'w', 'x']

Output: 5121


Input: Consider Input: 7, 18, ['279', 'o', '8421', 'e', '2167', '6647', 'i', 's', 'I', 'G', '8201', 'E', 'h', 'U', '403', 'c', 'u', 'B', '9415', 't', 'a', '8787', 'E', '9677']

Output: 8604


Input: Consider Input: 9, 23, ['3553', '521', '6035', '2407', 'o', 'D', '5371', '621', 'z', 'H', 'u', 'B', '797', 'j', '8663', 'P', 'F', 'q', 'c', '3849', 'k', '2179', '6823', 'a', '8791', '8671', 'Z', '3909', '2973']


Output: 22311