N := 2^2*3*313;
bound := 4000;


   F<alp> := GF(25);
   G<a,b,c>:=DirichletGroup(N, F);
   assert Order(a) eq 2;
   assert Order(b) mod 2 eq 0;
   assert Order(c) mod 3 eq 0;
   eps := b^(Order(b) div 2) * (c^(Order(c) div 3));
   assert Order(eps) eq 6;

   time M := ModularSymbols(eps,5,+1);
   "Created M = ", M;

   R<x>:= PolynomialRing(F);
   I := [<17,x>, <61,x>, <67,x>, <11, x+alp^4>];
   time V := Kernel(I, M);
   "Created V = ", V;
   save "3756.space";

   if Dimension(V) ne 2 then
      error "Dimension of V is not 2.";
   end if;
   
printf "Computing T_2, T_3, T_5, ..., T_%o.\n", PreviousPrime(bound+1);
time T := [DualHeckeOperator(V,p) : p in [2..bound] | IsPrime(p)];

file := Open(IntegerToString(N) cat ".Tp", "w");
fprintf file, "F<alp> := GF(%o);\n", #F;
fprintf file, "T%o := \n %m;\n", N, T;

print "All done!";
