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, 8, ['x', 's', '1415', '6003', '2237', 'g', 'l', 'a', 'l', 'y', 'y', '4651', 'e', 'D', 'g']
Example Output: 0

Example Input: 5, 6, ['3087', '7917', 'M', '4557', '4409', 'N', '1843', 's', '1883', 'L', '315', '9983', 'n', 'H', 't', '4419']
Example Output: 4409

Example Input: 2, 15, ['1717', 'h', 'P', 'S', 'L', 'w', '691', 'i', '5997', 'i', '125', 'O', 'h', 'e', 'V', 'k', '3067', '8911', '1675', '9383', '3435', '171', 'e', 'B', '2991', 'M', 'X', 'T']
Example Output:
6813