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.

1, 3, ['7641', '5147', '995', 's', '6697']
13783

7, 26, ['I', 'K', '7025', 'g', '271', '9365', 'i', '449', 'q', '8499', '4887', 'M', '885', '3831', '4789', 'I', '8181', 'b', 'I', '5639', 'p', '649', '535', 'k', '6621', 'j', '9539']
44965

8, 12, ['4459', '8899', 'U', 'O', 'z', 'h', '9887', '3461', 'M', 'm', '4859', 'H', '9419', 'z', '3011', 'Y', 'H', 'a', '6197', 'p', '8075', 'r', '4461']

8320