public static void Main()
long[] Primes = GetPrimes(9999), build = new long[4];
int i = 1001, c1 = 0, c2 = 0;
for (int j = 0; j < 4; j++)
if (s1.Contains(s2[j] + ""))
if (IsPrime(i + 3330 + 3330))
for (int j = 0; j < 4; j++)
if (s1.Contains(s3[j] + ""))
Console.WriteLine(i + "" + (i+3330)+"" + (i+6660)+"");
public static bool IsPrime(long num)
int s = (int)Math.Sqrt(num);
for (int i = 3; i <= s; i += 2)
public static long[] GetPrimes(int len)
long[] arr = new long[len];
for (int i = 1; i < len; i++)
long[] r = new long[counter];
for (int i = 0; i < counter; i++)