N := 2^5*43;
bound := 4000;


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

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

   R<x>:= PolynomialRing(F);
   I := [<19,x>, <31,x>, <97,x>, <3, x-alp^16>];
   time V := Kernel(I, M);
   "Created V = ", V;
   
   save "1376.space";

/*

   restore "1376.space";
*/

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("1376.Tp", "w");
fprintf file, "F<alp> := GF(%o);\n", #F;
fprintf file, "T%o := \n %m;\n", N, T;

print "All done!";