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: 1, 7, ['J', 'l', '9145', '5805', '4377', '2851', '8781', '7353', '145']
Example Output: 30959

Example Input: 2, 15, ['r', '3527', 'Z', '9011', 'm', '879', '5305', '7153', 'c', '3567', 'd', '2319', 'M', 'y', '7703', '4899', 'G']
Example Output: 39464

Example Input: 4, 14, ['D', '4109', '7613', 'R', 'a', 'e', '2183', 'm', '1433', 'k', 'P', '5689', 'n', '7695', 'h', '7275', '2501', 'q', 'j', '5793', 'v', '7283', 'w', '7417', '8587', 'R', 'V']
Example Output:
17000