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: 10, 12, ['465', 'V', '3045', 'M', 'Z', '4053', '9621', '6909', '3161', 'M', '6675', '2313', 'v', 'g', 'a', 'x', '9347', 'd', 'x', '4309', '7231', '9745', 'F', '8863', '4667', '2089', 'x']

Output: 8988


Input: Consider 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']

Output: 69831


Input: Consider Input: 1, 5, ['9197', 'E', 'D', '7449', '8331', 'W', '8803', 'T', '4183', 'W', 'o', '2571', '4827', '1277', '8661', 'q', '333', '8877', 'n', 'b', 'd', '681', 'u', 'n', '7065', 'u', 't', '4443', '4931', '9367']


Output: 24977