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: 6, 7, ['k', 'F', 'I', '1481', 'v', '5085', 'V', '9661', '525']
Example Output: 5085

Example Input: 6, 8, ['x', 's', '1415', '6003', '2237', 'g', 'l', 'a', 'l', 'y', 'y', '4651', 'e', 'D', 'g']
Example Output: 0

Example Input: 5, 15, ['1223', '9979', '4041', '6277', '3285', 'o', 'N', 'n', 'Q', '1443', 'K', '6451', 'b', '5355', '1247', 'l', '2503', '3391', '5319', 'm', '8857', '933', '9645', 'i', 'W', '4231', '5033', '4911', '4981', 'B']
Example Output:
17781