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.

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

A: 34908
****
Q: 1, 5, ['O', '4521', 'w', '6745', 'W', '7743', '4113', '7179', '9751', '2365', '9161', 'j', '1339', '6927']

A: 11266
****
Q: 6, 17, ['W', '5009', 'v', '9463', '8975', '6719', '3497', '5547', '2717', 'M', '1447', '7625', 'v', 'y', 'V', '3657', '1743', 'S', 'k', '5195', 'P']

A:
32952
****