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: 12, 24, ['3749', 'r', '9823', 'Y', 'K', 'V', 'q', 'H', '3273', '3091', '9531', 'E', '2219', '3101', 'P', 'k', 'r', 'a', 'T', 'I', 'j', 'i', '4045', 'K', 'r']

Output: 9365


Input: Consider Input: 6, 7, ['6261', 'l', 'T', 't', 'X', 'G', 'Y', 'f']

Output: 0


Input: Consider Input: 6, 15, ['6213', 'k', '8431', '1507', '8919', 'Y', '1361', 'i', '9687', 'w', '3757', '5027', 'w', 'v', '2145', '3753', 'N', 'q', 's', '269', '6327', 'l', 'f', 'v', '9561']


Output: 21977