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.

2, 9, ['5655', '7555', 'T', '3387', 'G', '9547', 'Z', '8679', '1561', 'E', '469']
30729

1, 11, ['q', 'q', 'P', '4335', 'l', 'k', 'D', 'R', '719', 'g', '855', 'l', '6639', '7935', '8407', 'A', 'H', '8357', '759', 'i', '1205', 'B', 'Q', 'V', '359', '4565', '9975', 'g', 'h', '9585']
5909

6, 14, ['707', 'L', '8503', 'x', 'Y', '921', '8415', '6449', '5711', 'd', '591', 'd', '3827', '5569', 'g', 'U', 'v', '7781', 'E', 'z', '4751', '8541', 'c', 'P', '8037', 'X']

31483