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]: 1, 13, ['9225', '8983', 'E', 'F', 'L', 'V', 'h', '9233', '8887', 'o', 'd', 'U', 'B', 'u']
[EX A]: 36328

[EX Q]: 4, 11, ['4679', 'V', '3421', '8995', '2885', '5395', 'E', '2169', 'i', 'B', '9279', 'G', 'N', 'I', 's', '6827', 'S']
[EX A]: 28723

[EX Q]: 1, 21, ['O', '2773', '6791', '4657', '6481', '6013', '2519', 'W', 'k', '9789', 'J', 'K', '3631', '9379', '7163', 'z', '3235', 'y', 'v', '5585', 'm']
[EX A]:
68016