#include const int MAX = 128; const int INF = 2000000000; char NAMEK[MAX],NAMEL[MAX]; int Fr[MAX]; int T[MAX][MAX]; int Best[MAX][MAX]; int K,L; void Read() { scanf("%d%d%s%s",&K,&L,NAMEK,NAMEL); for(int i=0;i=0;i--) { if(i!=c) { f+=Fr[i]; cost+=f; } if(T[k-1][i]!=INF && T[k-1][i]+cost <= T[k][c]) { Best[k][c]=i; T[k][c]=T[k-1][i]+cost; } } } } void Write() { int k,c; static int Kon[MAX]; Kon[K]=L; for(k=K-1;k>=0;k--) Kon[k]=Best[k+1][Kon[k+1]]; c=0; for(k=0;k