5            m |= (1 << i)
6    return m
7
8print(find_m(10, 8))

11            list[stack_number-1].pop()
12
13    def push(self, item, stack_number):
14        list[stack_number-1].append(item)

21        print(sum(11))
22
23if __name__ == '__main__':
24    main()

34
35for i in range(1,n+1):
36    p+=str(((i>=n-o+1 and s[i-n+o-1]=='1')|(int(s[i-1])-48))+48)
37print(p)

3    a, b = input().split()
4    a = int(a)
5    b = int(b)
6    print(a*b)