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, 11, ['4195', 'G', '3905', '8825', 'J', 'I', 's', 'd', '2681', 'g', '3873', 'N', '9349']
23479

1, 7, ['u', 'Z', 'j', 'A', 'N', 's', 'h', '7331', '8259']
0

2, 7, ['d', 'W', '6405', '4523', 'U', '9755', 's']

20683