#algorithm for listing prime numbers between given range
#foolproof input
#Disclr : Documentation only for noobs like me, smarties ignore
#There is always room for improvement

print("Prime Numbers : number which has only two divisors\n")

def get_int_input():                                                                #to get integer input no matter what
    while True:
        try:
            Startinginputnumber = int(input("\nEnter the starting number :: "))     #try <- tries some thing as coded (in this case it is just to check if user enters something other than integers)
            Endinginputnumber = int(input("\nEnter the ending number :: "))
            if Startinginputnumber > Endinginputnumber:                             #user should enter starting number less than ending number
                continue
            else :
                break
        except ValueError:                                                          #in case of occuring of specified error it takes furthur action as coded
            continue
    return Startinginputnumber, Endinginputnumber
def check_for_prime(number):                                                        #checks if the number is prime (returns true if true)
    c = 0                                                                           #c for counting number of divisor
    for i in range(1,number+1):                                                     #counting from 1 to whatever value number has
        if number % i == 0:
            c += 1
            if c > 2:
                return False                                                        #return false if there are more than 2 divisor, because definition of prime numbers
            else:
                continue
        else:
            continue
    return True
def main():                                                                         #main function
    Startinginputnumber, Endinginputnumber = get_int_input()                        #get input
    print("starting num = ",Startinginputnumber)
    print("ending num   = ",Endinginputnumber)
    prime = []                                                                      #empty list for appending prime numbers
    if Startinginputnumber < 2:
        Startinginputnumber = 2                                                     #make starting number 2 because 1 is not prime
    for number in range(Startinginputnumber, Endinginputnumber):                    #check all numbers #prime_filter lol
        if check_for_prime(number):
                prime.append(number)
        else:
            continue
    c = 1
    for i in prime:                                                                 #print all numbers with index
        print('#',end = '')
        print(c,' ',i)
        c += 1
main()                                                                              #don't forget to call main function