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.

[EX Q]: 3, 15, ['q', '3851', '3631', 'z', '6681', 'Z', '461', 'K', 'P', 'i', '9039', '5929', '1415', 'o', 'O', 'H', '4047', 'B', '7073', '2087', 'I', '6857', '5751', '3633', 'U', '869', 'n', 'h', '7807', '469']
[EX A]: 27156

[EX Q]: 9, 10, ['8997', 'P', '2065', 'F', '2531', 'o', 'a', '3057', '7393', '2665', '4563']
[EX A]: 10058

[EX Q]: 16, 22, ['6643', 'm', 'A', 'v', '6959', '5871', '4977', 'r', '2173', '51', 'W', '5705', 'b', 'e', 'O', '4201', '2031', 'C', '1309', 'V', '8455', '2441', '1491', 'd', 'E', 'n', '8985', '6177']
[EX A]:
18437