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, 11, ['8449', 'j', '8735', '2839', '2773', '1659', 'V', 'I', 'x', 'V', 't', '7837', 'F', 'N', '4179', 'G', 'f', '8193']
[EX A]: 0

[EX Q]: 4, 13, ['d', 'v', 'K', '2011', '7323', '5735', 'u', '4227', 's', 'n', '1161', 'm', '5463', 'I', '2813']
[EX A]: 25920

[EX Q]: 11, 21, ['2461', 'U', '4893', '227', 'y', '9975', 'p', '9477', 'D', 'N', 'a', '6779', 'T', '4081', 'p', '2893', '6417', 'b', '6373', 'B', '4705', '8117']
[EX A]:
31248