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.

4, 13, ['2921', '5905', '2835', '3625', '2481', '1657', '6239', '2393', 'u', '3255', '7061', '8197', 'k', '269', '1135', '5833', '7847', 'C', '4371', '4783', '9613']
34908

3, 6, ['d', 'v', 'd', '5043', '8989', 'w', 'Y']
14032

2, 13, ['n', '6159', '8359', 'u', '2065', 'T', 'k', '6337', '7731', '7747', '1101', '9243', 'h', '7243', 'v', 'K', '9235', 'o', '9369', 'o', 'S', 'B', '7183', 'N']

48742