uses crt;

var S, X : string; T : byte;

begin

clrscr;

write('- Nhap xau S = '); readln(S);

write('- Nhap thoi diem T = '); readln(T);

if T <= 10 then write(copy(S, 1, T))

else

    begin

        T := T mod 10 + 1;

        X := copy(S, T, 10);

        if length(X) < 10 then X :=  X + copy(S, 1, 10 - length(X));

        write(X);

    end;

readln

end.

#include <bits/stdc++.h>
#define ll long long
const int base = 257;
const int MOD = (int) 1e9+7;
const int maxn = (int) 1e6+3;
using namespace std;
inline ll gcd(ll a,ll b){if(b==0)return a; return gcd(b,a%b);}
inline ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

string S;
int T;

int main(){
 cout << "Nhap xau S = ";
 cin >> S;
 cout << "Nhap thoi diem T = ";
 cin >> T;
 if (T <= 10){
  for (int i = 0; i < T; i++) cout << S[i];
 }
 else{
  int dig = T%10;
  for (int i = dig; i < 10+1; i++) cout << S[i];
 }
 return 0;
}