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.

[EX Q]: 7, 17, ['149', 'O', 'h', '7873', '9227', '5655', '8945', 'I', 'c', 'V', 'Z', 'I', 'L', '1153', 'L', 'Y', '2031', 'B', 'S', 'x', 'u', '2483', 'M', '2469', '4991']
[EX A]: 12129

[EX Q]: 2, 2, ['V', 'a']
[EX A]: 0

[EX Q]: 2, 11, ['4153', 'n', 'i', 'Z', '4071', '8995', '4935', '8819', 'I', '2501', '659', '9499', 'R']
[EX A]:
29980