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: 13, 19, ['5529', 'd', 'W', 'b', 'I', '65', '9995', '6331', '9373', 'V', '8389', 'E', '7455', '105', 'W', 'r', '7733', '7607', 'L', '5553', 'e']
Example Output: 22900

Example Input: 1, 15, ['t', '77', '6593', '3683', '5673', '9391', 'Y', 'A', '3273', '379', '6569', 'l', 'u', '8633', 'M', '8587', '3127', '5885', '4083']
Example Output: 44271

Example Input: 1, 20, ['2855', 'k', '3757', '9507', '415', '7285', '9089', 'd', 'V', '35', '4313', 'V', '5353', '1219', 'A', '8181', '2149', 'H', '3141', 'D', '571', 'Y', 'I']
Example Output:
57299