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.

Example Input: 14, 15, ['N', 'u', '4633', '5481', '2469', 'y', '2253', '4629', '8399', 'q', 'H', '8507', '1789', 'A', '5085', 'G', '9679', 'G', 'u', '9381']
Example Output: 5085

Example Input: 9, 13, ['2813', 's', 'z', 'G', '5927', '4415', 'T', 'c', '7029', 'e', 'o', 'd', '5913', 'y']
Example Output: 12942

Example Input: 13, 15, ['L', '2057', 'V', '5981', '3269', 'u', 'y', '8227', '981', 'e', 'v', 'V', '3097', 'Q', '9365', '4913', 'y', '2981', 'H', 'K', 'a', 'Q', '201', 'w', '3529', '5431']
Example Output:
12462