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: 17, 18, ['449', '4995', 'M', '245', 'i', '6859', 'A', '3527', '7063', 'l', '2869', 'Z', '8739', '7057', '4815', '3263', 'P', 'l', '393', 'P', '1701', '5135', 'G', 'O', 'y', 'o', '3815']
Example Output: 0

Example Input: 3, 6, ['7073', '3047', 'O', 'c', 'u', 'G']
Example Output: 0

Example Input: 3, 4, ['C', 'b', '1869', '7115', 'q', '3001', '4915', 'I', '3387', '7047', '9669', 'D', 'h', '503', '837', '1543', '763']
Example Output:
8984