prime.php rebuild

<?php
    $p = null;
    function isPrime($i) {
        global $p;
        for ($j = 1, $l = sizeOf($p),  $s = sqrt($i); $j < $l; ++$j) {
            $k = $p[$j];
            if ($k > $s)
                return true;
            if ($i % $k == 0)
                return false;
        }
        return true;
    }

    for ($c = 0, $k = $argv[1]; $c < 1000; ++$c) {
        $p = array(2);
        for ($i = 3, $l = $argv[2]; $i <= $l; $i += 2)
            if (isPrime($i))
                $p[] = $i;
    }
?>