Prime numbers generator!

gistfile1.txt

# Using Sieve of Eratosthenes
# https://en.wikipedia.org/wiki/Generating_primes

import sys

def main():
    num = int(sys.argv[1])
    num_list = [[i,True] for i in range(num)]
    num_list[0][1] = False
    num_list[1][1] = False
    prime_list = []
    for i in range(num):
        if num_list[i][1] == True:
            prime_list.append(num_list[i][0])
            for j in range(2, num/num_list[i][0] + 1):
                k = j * num_list[i][0]
                if k < num:
                    #print i, j, k, num_list[k]
                    num_list[k][1] = False
    return prime_list

if __name__ == '__main__':
    x = main()
    print x[-1]