public static void primegenerate(int start,int end)
	{
		boolean result = false;
		if(start == 1)
			start = start+1;
		
		for(int i=start;i<=end;i++)
		{
			result = true;
			int root = (int) Math.sqrt(i);
			
			for(int j=0;j<3401;j++)
			{
				if(prime.get(j) > root)
					break;
				
				if(i % prime.get(j) == 0)
				{
					result = false;
					break;
				}
			}
			if(result)
				System.out.println(i);
		}
	}