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: 10, 22, ['4049', '2745', 'g', 'T', 'N', 'u', 'Q', '3687', '5871', 'i', '9139', '585', '8435', '5761', '5825', '5909', 'f', '6317', '8227', '4051', 'E', '5167', '6953', 'g', '4113', '2493']
Example Output: 59416

Example Input: 10, 15, ['n', '4807', 'a', 'Q', '3781', 'h', '1553', 'n', 'J', 'L', 'M', '3781', '6375', '2429', 'O', '1687', 'L', 'S', '607', '9433']
Example Output: 12585

Example Input: 1, 20, ['q', 'Z', 'j', 'w', '4453', '9681', 'c', 'p', '3911', '7409', 'P', 'V', 'H', 'N', 'h', '1751', 'H', '3017', 'r', '5311', 'j', '5283', '2021', '1633', 'p', 'I', 'V']
Example Output:
35533