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]: 9, 9, ['8073', 'i', '5725', 'j', '4631', 'h', '245', '2191', '2445', '267', 'V', 'D', '3385', 'W']
[EX A]: 2445

[EX Q]: 1, 6, ['H', '7937', '9919', 'G', 's', '1929', '8585', 'n', 'u', 'J', 'C', '387']
[EX A]: 19785

[EX Q]: 2, 16, ['3997', '6955', 'q', '9811', '331', '6253', '5353', '4665', '7263', 'o', '7493', 'h', 'x', '2663', '9749', 'X', '1287', '1089', '5921', '1841', '7667']
[EX A]:
60536