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: 2, 16, ['e', 'Q', '4017', '1999', '2413', 'v', '4911', 'N', 'x', '3475', '2179', 'o', 'a', '6361', '1723', '6273']
Example Output: 33351

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: 1, 5, ['6449', 'V', '3359', '5893', 'H', 'I', 'j', '9281', 's', 'u', '5729', 'I', '7119', '9425', 'c', 'n', 'n', 'R', '113', '7129', '6747']
Example Output:
15701