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: 6, 8, ['s', 'X', 'a', 'L', 'N', 'J', '1893', '4909', '349', '7679', '4479', 'i', '7345']

Output: 6802


Input: Consider Input: 17, 27, ['Z', '6899', 'S', '5053', '7009', 'w', 'i', 'x', '8139', '6287', 'N', 'q', '4037', 'T', 'U', '5347', 'Y', 'e', 'v', '5041', '807', '505', 'w', 'j', '6951', 'k', '4071']


Output: 17375