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: 14, 14, ['a', 'i', '5431', 'U', '9109', 'm', 'H', '7643', '127', 'a', 'S', '4285', '5625', '5479', '6409', 'U', 'n', 'R']

Output: 5479


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: 6, 14, ['199', 'S', '623', 'n', '53', 'i', 's', 'T', '1531', '4321', '4563', '4899', 'u', 'Y', '7541', 'D', 'K', '7433', '7681', 'Q']


Output: 15314