Erelong Leha was bored by calculating of the greatest common divisor of two factorials. Therefore he decided to solve some crosswords. It's well known that it is a very interesting occupation though it can be very difficult from time to time. In the course of solving one of the crosswords, Leha had to solve a simple task. You are able to do it too, aren't you?

Leha has two strings s and t. The hacker wants to change the string s at such way, that it can be found in t as a substring. All the changes should be the following: Leha chooses one position in the string s and replaces the symbol in this position with the question mark "?". The hacker is sure that the question mark in comparison can play the role of an arbitrary symbol. For example, if he gets string s="ab?b" as a result, it will appear in t="aabrbb" as a substring.

Guaranteed that the length of the string s doesn't exceed the length of the string t. Help the hacker to replace in s as few symbols as possible so that the result of the replacements can be found in t as a substring. The symbol "?" should be considered equal to any other symbol.


-----Input-----

The first line contains two integers n and m (1 ≤ n ≤ m ≤ 1000) — the length of the string s and the length of the string t correspondingly.

The second line contains n lowercase English letters — string s.

The third line contains m lowercase English letters — string t.


-----Output-----

In the first line print single integer k — the minimal number of symbols that need to be replaced.

In the second line print k distinct integers denoting the positions of symbols in the string s which need to be replaced. Print the positions in any order. If there are several solutions print any of them. The numbering of the positions begins from one.


-----Examples-----
Input
3 5
abc
xaybz

Output
2
2 3 

Input
4 10
abcd
ebceabazcd

Output
1
2

Difficulty: interview

Starter code:

Solutions:
n, m = map(int, input().split())
mi = 100000000000000
ts = ""
def num_d(a, b):
  t = 0
  for x in range(len(a)):
    if a[x] != b[x]:
      t += 1
  return t
s, t = input(), input()
for x in range(m-n+1):
  d = num_d(s, t[x:x+n])
  if d < mi:
    mi = d
    ts = t[x:x+n]
print(mi)
for x in range(n):
  if s[x] != ts[x]:
    print(x+1, end=" ")


n, m = list(map(int, input().split()))
s = input()
t = input()

ans = [i for i in range(1, n + 1)]
for i in range(m - n + 1):
    pos = []
    for j in range(n):
        if s[j] != t[i + j]:
            pos.append(j + 1)
    if len(pos) < len(ans):
        ans = pos

print(len(ans))
print(' '.join(map(str, ans)))


n, m = map(int, input().split())
s = input()
t = input()
ansC = 10 ** 9
ans = []
i = 0
while i < m - n + 1:
    nowc = 0
    now = []
    for j in range(n):
        if s[j] == t[i + j]:
            continue
        nowc += 1
        now.append(j + 1)
    if nowc < ansC:
        ansC = nowc
        ans = now[:]
    i += 1
print(ansC)
print(*ans)

import sys

def main():
    n,m = list(map(int,sys.stdin.readline().split()))
    
    s = sys.stdin.readline().rstrip()
    t = sys.stdin.readline().rstrip()

    r = 10000
    res = []
    for i in range(m-n+1):
        p = []
        c = 0
        for j in range(n):
            if s[j]!= t[i+j]:
                c+=1
                p.append(j+1)
        if c < r:
            r = c
            res = p
    print(r)
    if r!=0:
        print(" ".join(map(str,res)))

    
main()


def f(s,t):
	a=[0,[]]
	for i in range(len(s)):
		if s[i]!=t[i]:
			a[0]+=1
			a[1].append(i+1)
	return a
n,m=list(map(int,input().split()))
s=input()
t=input()
ans=2000
a=[]
for i in range(m-n+1):
	if f(s,t[i:i+n])[0]<ans:
		ans,a=f(s,t[i:i+n])
print(ans)
for i in a:
	print(i,end=' ')

n,m = list(map(int, input().split()))
s = input()
t = input()


tot = 1000000000
pos = []

for k in range(m-n+1):
    ctot = 0
    cpos = []

    for e in range(n):
        if s[e] != t[e+k]:
            cpos.append(e+1)
            ctot+=1

    if ctot < tot:
        pos = cpos
        tot = ctot

print(tot)
print(*pos)


a, b = map(int, input().split())
s = input()
t = input()
sl = len(s)
tl = len(t)
mask = []
best = 0
besti = 0
for i in range(tl - sl + 1):
    eq = 0
    for j in range(sl):
        if t[i + j] == s[j]:
            eq += 1
    if eq > best:
        best = eq
        besti = i
for j in range(sl):
    if t[besti + j] != s[j]:
        mask.append(j + 1)
print(sl - best)
for i in mask:
    print(i, end=' ')


n, m = map(int, input().split())
s = input()
t = input()
res = 10 ** 9
ans = []
for i in range(len(t) - len(s) + 1):
    curr = []
    for j in range(i, i + len(s)):
        if s[j - i] != t[j]:
            curr.append(j - i + 1)
    if len(curr) < res:
        res = len(curr)
        ans = curr[:]
print(res)
print(' '.join(map(str, ans)))

n, m = input().split()
n, m = int(n), int(m)

s = input()
t = input()

min_c = 10**4
min_pos = []
for i in range(m - n + 1):
    c = 0
    pos = []
    for j in range(n):
        if s[j] != t[i + j]:
            c += 1
            pos.append(j + 1)
    if c < min_c:
        min_c = c
        min_pos = pos[:]

print(min_c)
for i in range(len(min_pos) - 1):
    print(min_pos[i], end=" ")
if(len(min_pos) > 0):
    print(min_pos[-1])


def fit(s1,s2,i):
	count=0
	for j in range(len(s1)):
		if(s2[j+i]!=s1[j]):
			if(s1[j]=='?' or s2[j+i]=='?'):
				continue
			count+=1
	return count

def calc(s1,s2,mmin):
	l=[]
	for i in range(len(s1)):
		if(s1[i]!=s2[i+mmin]):
			if(s1[i]=='?' or s2[i+mmin]=='?'):
				continue
			l.append(i+1)

	return l


inp=input().split()
s1=input()
s2=input()
m=9999999
mmin=0
for i in range(len(s2)-len(s1)+1):
	val=fit(s1,s2,i)
	if(val<m):
		m=val
		mmin=i
print(m)
l=calc(s1,s2,mmin)
for val in l:
	print(val,end=" ")

print()

x,y=list(map(int,input().split()))
s=input()
t=input()
l=[i for i in range(1,x+1)]
ans=x
for i in range(1+y-x):
	temp=0
	k=[]
	for j in range(x):
		if s[j:j+1]!=t[i+j:i+j+1]:
			temp+=1
			k.append(j+1)
	if temp<ans:
		ans=temp
		l=k
print (ans)
print(*l)


string = input()
numbers = string.split(" ")
a = int(numbers[0])
b = int(numbers[1])
s = input()
t = input()
values = []
lists = []
for x in range(b - a + 1):
    substring = t[x:(x + a)]
    n = 0
    positions = []
    for y in range(a):
        p = substring[y]
        q = s[y]
        if p != q:
            positions.append(str(y + 1))
            n += 1
    values.append(n)
    lists.append(positions)
minimum = min(values)
print(minimum)
print(" ".join(lists[values.index(minimum)]))

n, m = [int(val) for val in input().split()]
s = input()
t = input()
ans = 100000000
ansL = []
for i in range(m - n + 1):
	val = 0
	valL = []
	for j in range(n):
		if s[j] != t[j + i]:
			val += 1
			valL.append(j + 1)
	if val < ans:
		ans = val
		ansL = valL
print(ans)
for ind in ansL:
	print(ind, end=' ')

n,m=list(map(int,input().split()))
S=input()
S1=input()
t=[]
for i in range(m-n+1) :
    k=0
    t1=[]
    V=''
    for j in range(i,i+n) :
        if S1[j]!=S[j-i] :
            t1.append(j-i+1)
    t1=[len(t1)]+t1
    t.append(t1)
t=sorted(t)
print(t[0][0])
print(*t[0][1:])
            
        
        


I = lambda: list(map(int, input().split()))
n, m = I()
s, t = input(), input()
res = 0
res_details = []
for i in range(m-n+1):
    #print(t[i:i+n])
    eq = 0
    detail = []
    for j in range(i,i+n):
        if not (ord(s[j-i]) - ord(t[j])):
            eq += 1
        else:
            detail.append(j-i+1)
    if eq >= res:
        res = eq
        res_details = list(detail)
print(n-res)
print(*res_details)


from textwrap import wrap

input()
s = input()
t = input()

r = int(1e9)
p = list()

for i in range(len(t) - len(s) + 1):
    f = [x != y for x, y in zip(t[i: i + len(s)], s)]
    g = f.count(True)

    if g < r:
        r = g
        p = [str(i + 1) for i, e in enumerate(f) if e]

print(r)
print(' '.join(p))

line = input().split()
n = int( line[0])
m = int(line[1])
s = input()
t = input()
min = n + 1
A = []
for i in range(m-n+1):
    ii = i
    L = []
    k = 0 
    for j in range(len( s)):
        if ( t[ii] != s[j] ):
            L.append(j+1)
            k = k + 1
        ii = ii + 1
    if ( k < min ):
        min = k
        A = L
print(min)
for i in range(len(A)):
    print(A[i], end = " ")
print()


def distance(a, b):
    return sum(1 for i in range(min(len(a), len(b))) if a[i] != b[i])


def solve(inp, s, t):
    n, m = list(map(int, inp.split(" ", 1)))
    best_shift = None
    best_distance = float("inf")
    for shift in range(m - n + 1):
        dist = distance(s, t[shift:shift + n])
        if dist < best_distance:
            best_shift = shift
            best_distance = dist
    positions = [i + 1 for i in range(n) if s[i] != t[best_shift + i]]
    return best_distance, positions


def __starting_point():
    inp = input()
    s = input()
    t = input()
    k, positions = solve(inp, s, t)
    print(k)
    print(" ".join(map(str, positions)))

__starting_point()

def check(r, o, p):
    change = 0
    for j in range(0, a):
        if o[j] != p[j + r] and o[j] != '?':
            change += 1
    return change
a, b = input().split()
a, b = [int(a), int(b)]
s = input()
t = input()
_min = b
ans = 0
for i in range(0, b - a +1):
    if check(i, s, t) < _min:
        _min = check(i, s, t)
        ans = i
print(_min)
for k in range(0, a):
    if s[k] != t[k + ans]:
        print(k+1, ' ', end='')


# IAWT
n, m = list(map(int, input().split()))
s = input()
t = input()

def needs(i):
    x = 0
    for u in range(n):
        if t[i+u] != s[u]:
            x += 1
    return x


need = n
ind = 0
for i in range(m - n + 1):
    x = needs(i)
    if x < need:
        need = x
        ind = i

out = str(need) + '\n'
for i in range(n):
    if t[ind+i] != s[i]:
        out += str(i+1) + ' '

print(out[:-1])


import sys
read=lambda:sys.stdin.readline().rstrip()
readi=lambda:int(sys.stdin.readline())
writeln=lambda x:sys.stdout.write(str(x)+"\n")
write=lambda x:sys.stdout.write(x)
n,m = list(map(int, read().split()))
s,t = read(), read()

mcnt, midx = -1, -1
for i in range(m-n+1):
    cnt = 0
    for j in range(n):
        if s[j] == t[j+i]:
            cnt += 1
    if cnt > mcnt:
        mcnt = cnt
        midx = i
    

k = 0
pos = []
for i in range(n):
    if s[i] != t[midx+i]:
        k += 1
        pos.append(str(i+1))

writeln(k)
if k:
    writeln(' '.join(pos))


n,m=list(map(int,input().split()))
s=str(input())
t=str(input())
a=n
b=0
for i in range(0,m-n+1):
    d=0
    for j in range(0,n):
        if t[i+j]!=s[j]:
            d=d+1
    if d<a:
        a=d
        b=i
print(a)
for j in range(0,n):
    if t[b+j]!=s[j]:
        print(j+1)


a,b=map(int,input().split())
s=str(input())
t=str(input())
m=0
ind=0
for i in range(b-a+1):
    a1=list(t[i:i+a])
    a2=list(s)
    #print(a1,a2)
    c=0
    for j in range(a):
        #print(i,j)
        if a1[j]==a2[j]:
            c+=1
    #print(c)
    if c>m:
        m=c
        ind=i
l1=list(t[ind:ind+a])
a3=list(s)
print(a-m)
for i in range(a):
    if a2[i]!=l1[i]:
        print(1+i,end=' ')
            

#!/bin/python3
import sys
import time
import heapq
import collections
from io import StringIO

test_cases = [
    ("""
3 5
abc
xaybz
""", """
2
2 3 
"""),
    ("""
4 10
abcd
ebceabazcd
""", """
1
2 
"""),
]


def solve():
    return "TEST"


def debug(*args, **kwargs):
    print(*args, **kwargs, file=sys.stderr)


def main():
    n, m = map(int, input().split())
    s = input()
    t = input()
    min_diff = None
    for i in range(m - n + 1):
        diff = [k + 1 for k, c in enumerate(s) if c != t[k + i]]
        if min_diff is None or len(diff) < len(min_diff):
            min_diff = diff
    print(len(min_diff))
    print(' '.join(str(i) for i in min_diff))


def test(s, check):
    s = s.strip()
    check = check.strip()
    sys.stdin = StringIO(s)
    sys.stdout = out = StringIO()
    start_time = time.time()
    try:
        main()
    finally:
        exec_time = time.time() - start_time
        sys.stdin = sys.__stdin__
        sys.stdout = sys.__stdout__
    out.seek(0)
    result = out.read().strip()
    status = "SUCCESS" if result == check else "FAILURE"
    message = "status: {}, exec_time: {:.3f}".format(status, exec_time)
    debug(message)


def test_all():
    for s, check in test_cases:
        test(s, check)


def __starting_point():
    if len(sys.argv) > 1 and sys.argv[1] == '-t':
        test_all()
    else:
        main()

__starting_point()