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

6, 7, ['6261', 'l', 'T', 't', 'X', 'G', 'Y', 'f']
0

10, 24, ['7269', '1689', '1053', 'o', 'V', 'j', 'Q', '3655', '5861', '4123', '3041', '4599', 'A', '5809', '9645', '2813', 'j', 'N', 'f', '1217', '1147', 'M', 'P', 'L']

32394