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: 4, 5, ['b', 'u', '5279', '6945', '6631']

Output: 13576


Input: Consider Input: 4, 7, ['6307', 'N', '5209', 'M', 'k', 'd', '6933']

Output: 6933


Input: Consider Input: 3, 18, ['5225', 'd', '1149', 'c', 'f', '8889', '7395', '6943', 'e', '765', '5709', 'n', '3449', '3143', 'F', '1161', '2511', 'K', '6235']


Output: 41114