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]: 16, 17, ['5985', '1925', 'r', 'H', 'p', 'L', '5019', 'y', 'O', '6575', '9729', 'S', '2497', '43', 'u', '317', 'p', '3043', '3247', 'z', 'O', '8379', '7715', '8399']
[EX A]: 317

[EX Q]: 2, 2, ['M', '3453', '5733', '2337', '9975', '1827', 't', '4937']
[EX A]: 3453

[EX Q]: 2, 6, ['O', 'e', 'F', '1291', '6411', 'l', 'E', 'j', 'p', 'O', '9043', 'X', '5139', 't', '3899', 'N', '4983', '9539', 'O']
[EX A]:
7702