'''
na grapsete ena programma pou diabazei apo to plhktrologio 2 akeraies times
a,b a<b kai b>10 me ekseraiseis kai en synexeia kalei thn synarthsh pou gemizei
mia lsta me pseudotyxaies times uniform sto [a,b) kai mia synarthsh pou 
gemizei me times sto [a,b) kanonikhs katanomhs to plhthos ths listas einai n=2b
kai oi listes einai dhlwmenes global. Sth synexeia h main kalei  mia allh synarthsh
pou elegxei ta stoixeia twn listwn kai epistrefei mia lista me times twn thesewn
pou oi times twn dyo allwn listwn einai ises -> den katalaba xristo
'''
#!/usr/bin/python3
import random

#global listes
uniform_list=[]
gaussian_list=[]

def fill_uniform(a,b):
	global uniform_list
	uniform_list=[random.randint(a,b-1) for _ in range(2*b)]

def fill_gaussian(a,b):
	global gaussian_list
	count=2*b
	while len(gaussian_list)<count:
		x=int(random.gauss((a+b)/2, (b-a)/6))
		if a<=x<b:
			gaussian_list.append(x)

def find_equal_positions():
	ml=[]
	for i,(u,g) in enumerate(zip(uniform_list,gaussian_list)):
		if u==g:
			ml.append(i)
	return ml

def main():
	#den xreiazetai sthn main pali global einai hdh
	a=None
	b=None
	while True:
		try:
			a=int(input("Δώσε a:"))
			b=int(input("Δώσε b:"))
			if a>=b:
				raise ValueError("to a mikrotero tou b")
			if b<=10:
				raise ValueError("to b>10")
			break
		except Exception as e:
			print(f"Error {e}")
			exit(1)
	fill_gaussian(a,b)
	fill_uniform(a,b)
	print(gaussian_list)
	print(uniform_list)
	matches=find_equal_positions()
	print(matches)
	
if __name__=="__main__":
	main()