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, 13, ['W', '5479', 'v', '2193', '8465', '3805', 'e', '7721', '983', 'i', '7843', '6803', '9901', 'K', '375', '165', 'M', 'P', 'a', 'J']

Output: 24547


Input: Consider Input: 4, 8, ['V', 'd', 'c', '9255', 'A', '2017', '4525', '4237']

Output: 20034


Input: Consider Input: 6, 7, ['8443', 'D', 'h', '6481', 'B', 'g', 'd', 'p', 'H', 'm']


Output: 0