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: 3, 18, ['P', '1429', '3883', '1883', 'u', 'K', 'N', 'j', 'u', 'H', 'y', '7785', '7371', '6869', '1613', '6515', '695', 'U', 'u']
Example Output: 36614

Example Input: 4, 9, ['k', 'N', 'd', '9345', '2971', 'Q', '917', 'X', '417', 'y', 'B', '6149', '9769', '9949', '2339', 'Q', 'A', 'r', '1059', 'c', 'U', 'p', '6951', 'Z', 'F', '7753', 'g']
Example Output: 13650

Example Input: 8, 22, ['8323', '2651', 'D', '2853', 'D', '5077', '3939', 'Y', 'J', 'P', 'y', 'Y', '2863', '7177', '6571', 'Y', 'c', 'D', 'W', 'p', '3273', 'T', '6497', '871', 'n', 'I', 'l', '3953', '2495']
Example Output:
19884