=====Function Descriptions=====
itertools.permutations(iterable[, r])

This tool returns successive rlength permutations of elements in an iterable.
If r is not specified or is None, then r defaults to the length of the iterable, and all possible full length permutations are generated.
Permutations are printed in a lexicographic sorted order. So, if the input iterable is sorted, the permutation tuples will be produced in a sorted order.

Sample Code
>>> from itertools import permutations
>>> print permutations(['1','2','3'])
<itertools.permutations object at 0x02A45210>
>>> 
>>> print list(permutations(['1','2','3']))
[('1', '2', '3'), ('1', '3', '2'), ('2', '1', '3'), ('2', '3', '1'), ('3', '1', '2'), ('3', '2', '1')]
>>> 
>>> print list(permutations(['1','2','3'],2))
[('1', '2'), ('1', '3'), ('2', '1'), ('2', '3'), ('3', '1'), ('3', '2')]
>>>
>>> print list(permutations('abc',3))
[('a', 'b', 'c'), ('a', 'c', 'b'), ('b', 'a', 'c'), ('b', 'c', 'a'), ('c', 'a', 'b'), ('c', 'b', 'a')]

=====Problem Statement=====
You are given a string S.
Your task is to print all possible permutations of size k of the string in lexicographic sorted order.

=====Input Format=====
A single line containing the space separated string S and the integer value k.

=====Output Format=====
Print the permutations of the string S on separate lines.

Difficulty: introductory

Starter code:

# Enter your code here. Read input from STDIN. Print output to STDOUT

Solutions:
import itertools
s,n = list(map(str,input().split(' ')))
s = sorted(s)
for p in list(itertools.permutations(s,int(n))):
    print((''.join(p)))


#!/usr/bin/env python3

from itertools import permutations

def __starting_point():
    in_data = list(input().strip().split(' '))
    
    for el in permutations(sorted(in_data[0]), int(in_data[1])):
        print("".join(el))
__starting_point()