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.

[Q]: 9, 17, ['9485', '5729', 'N', 'v', 'H', 'j', 'K', 'D', 'R', '2515', 'O', '2001', '9877', 'p', 'Y', '8407', '647']
[A]: 23447


[Q]: 4, 11, ['4679', 'V', '3421', '8995', '2885', '5395', 'E', '2169', 'i', 'B', '9279', 'G', 'N', 'I', 's', '6827', 'S']
[A]: 28723


[Q]: 6, 14, ['3975', '119', '5615', '5019', '7145', '3387', 'P', 's', '1639', 'B', 'J', '6533', 'f', '647', '4695', 'I', 'c', '6623', 'e', '2243', '9955', 'B', '8343', 'y', '6625', 'Q', '5855']
[A]:
12206