오일러1086,1104

#1086 iRobot : 오일러OJ (euleroj.io)

#첫줄은 집합의 크기

#두번째는 집합의 원소

#세번재는 명령어수

def first(ar , a ,b):    #a to b ,min

    #newArr=ar[a:b]

    min=2001

   # print(ar[a-1:b+1])

    for i in range(a-1,b-1):

  

        if min>ar[i]:

            min=ar[i]

    if min>ar[b-1]:

        min=ar[b-1]

    print(min)

def second(ar , a ,b):    #a to b ,max

    #newArr=ar[a:b]

    max=-2001

   # print(ar[a-1:b+1])

    for i in range(a-1,b-1):

        if max<ar[i]:

            max=ar[i]

    if max<ar[b-1]:

        max=ar[b-1]

    

    print(max)

def third(ar,a,b):

    sum=0

    for i in range(a-1,b-1):

        #print(i)

        sum+=ar[i]

    sum+=ar[b-1]

    print(sum)

x=int(input())#집합의 크기 입력받는다.

arr=list(map(int, input().split()))#집합의 원소 리스트

command=int(input())#명령어 갯수

for i in range(0,command):

    commandArr=list(map(int, input().split()))

    #print(commandArr)

    if commandArr[0]==1:

        first(arr,commandArr[1],commandArr[2])

    elif commandArr[0]==2:

        second(arr,commandArr[1],commandArr[2])#리스트,a번째,b번째

    else:

        third(arr,commandArr[1],commandArr[2])

 

#1104 토끼 사냥 : 오일러OJ (euleroj.io)

x,y=map(int,input().split())

xArr=[]

yArr=[]

for i in range(1,x+1):

    if x%i==0:

        xArr.append(i)

for i in range(1,y+1):

    if y%i==0:

        yArr.append(i)

for i in range(0,len(xArr)):

    for j in yArr:

        print(xArr[i],end=' ')

        print(j)