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.

1, 2, ['4857', '6373']
11230

13, 19, ['5529', 'd', 'W', 'b', 'I', '65', '9995', '6331', '9373', 'V', '8389', 'E', '7455', '105', 'W', 'r', '7733', '7607', 'L', '5553', 'e']
22900

8, 22, ['291', '5055', '9627', 'i', 'x', '1523', 'C', '9181', 'h', '7557', 'S', '2143', '6827', '9839', '9349', '6655', '1181', 'o', '6579', 'J', 'T', '6811', '2525', '1559', 'C', '583', '8985', 'r']

66122