1269C - Long Beautiful Integer - CodeForces Solution

import sys
'''
'''


def run(x, k):
    n = len(x) % k
    m = len(x)//k
    x1 = x
    if n != 0:
        m += 1
        x1 = x+x[n:k]
    rt = []
    for i in range(0, len(x1), k):
        rt.append(x1[i:i+k])
    for i in range(1, len(rt)):
        if rt[0] < rt[i]:
            rt[0] = str(int(rt[0])+1)
            break
        if rt[0] > rt[i]:
            break
    return (rt[0]*m)[:len(x)]


if sys.argv[-1] == 't':
    cases = [
        ['353', 2, '353'],
        ['1234', 2, '1313'],
        ['1234', 3, '1241'],
        ['1214', 2, '1313'],
        ['1204', 2, '1212'],
        ['121256', 2, '131313'],
        ['121056', 2, '121212'],
        ['121210', 2, '121212'],
        ['12345', 2, '13131'],
        ['12345', 3, '12412'],
        ['12945', 3, '13013'],
    ]
    for case in cases:
        r = run(*case[:-1])
        if r != case[-1]:
            print(case, r)
else:
    b, k = input().split(" ")
    print(b)
    print(run(input(), int(k)))