def smallest_not_overlap_stride(kernel_size, stride):
    """
    Finds the smallest number greater or equal to kernel_size
    that is divisible by stride
    """
    rem = (kernel_size + stride) % stride
    return kernel_size if rem == 0 else kernel_size + stride - rem