Project euler 60: code problem

<pre>
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace Prime_pair_sets
{
    class Program
    {
        static void Main(string[] args)
        {
            int mc = 5;
            List<int> primes = new List<int>();
            int test = 2;
            int count = 0;
            int test2 = 0;

            while(primes.Count < mc)
            {
                test = MyMath.Here.NextPrime(test);
                int a = 0;
                foreach(int el in primes)
                {
                    if(MyMath.Here.IsPrime(test*Convert.ToInt32(Math.Pow(10,el.ToString().Length))+el)&&             MyMath.Here.IsPrime(el*Convert.ToInt32(Math.Pow(10,test.ToString().Length)) + test))
                    {
                        a++;
                    }
                    else
                    {
                        break;
                    }
                }


                if(a == primes.Count)
                {
                    test2 = test;
                    primes.Add(test);
                    count++;
                }
            }

            foreach(int a in primes)
            {
                Console.WriteLine(a);
            }
        }
    }
}