qyliang/CodeNanoFix huggingface dataset:
Buggy code:
n, m, c = map(int, input().split())
b = [int(x) for x in range(m)]
ans = 0

for j in range(n):
    a = input().split()
    for i in range(m):
        sum = 0
        sum += a[i]*b[i]
    if sum > -c:
        ans += 1

print(ans)

Fixed code:
n, m, c = map(int, input().split())
b = list(int(x) for x in input().split())
ans = 0

for j in range(n):
    a = list(int(x) for x in input().split())
    sum = 0
    for i in range(m):
        sum += a[i]*b[i]
    if sum > -c:
        ans += 1

print(ans)
Buggy code:
n,m,c=map(int,input().split())
b=[0 for i in range(m)]
a=[[0 for i in range(m)]for i in range(n)]
ans=0
count=0
for i in range(m):
  b[i]=int(input())
for i in range(n):
  for j in range(m):
    a[n][j]=int(input())
for i in range(n):
  for j in range(m):
    ans=ans+a[n][j]*b[j]
  if (ans+c)>0:
    count=count+1
print(count)

Fixed code:
n,m,c=map(int,input().split())
b=[0 for i in range(m)]
a=[[0 for i in range(m)]for i in range(n)]
k=[0 for i in range(m)]
count=0
b=list(map(int,input().split()))
a=[list(map(int,input().split()))for i in range(n)]
for i in range(n):
  ans=0
  for j in range(m):
    ans=ans+(a[i][j]*b[j])
  if (ans+c)>0:
    count=count+1
print(count)
Buggy code:
N, M, C = map(int, input().split())                                                                                                                         
B = list(map(int, input().split()))
 
S = [[0]*M for i in range(N)]
for i in range:
    S[i] = list(map(int, input().split()))

b = 0
 
for i in range(N):
    a = 0
    for ii in range(M):
        a += S[i][ii] * B[ii]
    a += C
    if a > 0:
        b += 1
print(str(b))

Fixed code:
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
 
S = [[0]*M for i in range(N)]
for i in range(N):
    S[i] = list(map(int, input().split()))
 
b = 0
 
for i in range(N):
    a = 0
    for ii in range(M):
        a += S[i][ii] * B[ii]
    a += C
    if a > 0:
        b += 1
 
print(str(b))
Buggy code:
N,M,C=map(int,input().split())
B=list(map(int,input().split()))
A=list(list(map(int,input().split()))for i in range(N))
print(A)
count=0
total=0
for i in range(N):
    for j in range(M):
        total+=A[i][j]*B[j]
    if total>-C:
        count+=1
        total=0
print(count)

Fixed code:
N,M,C=map(int,input().split())
B=list(map(int,input().split()))
count=0
for i in range(N):
    total=C
    A=list(map(int,input().split()))
    for j in range(M):
        total+=A[j]*B[j]
    if total>0:
        count+=1
print(count)
Buggy code:
n,m,c = map(int,input())
b = list(map(int,input()))
cnt = 0
for i in range(n):
  a = list(map(int,input()))
  res=0
  for j in range(m):
    res += a[i]*b[i]+c
  if res>0: cnt+=1
print(cnt)

Fixed code:
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
cnt = 0
for i in range(n):
    res=0
    a = list(map(int,input().split()))
    for j in range(m):
        res += a[j]*b[j]
    if res+c>0: cnt+=1
print(cnt)
Buggy code:
N,M,C = map(int,input().split())
B = list(map(int,input().split()))
A=[0]*N
ans=0
tmp=0

for i in range(N):
  A[i]= list(map(int,input().split()))
  for j in range(M):
    tmp += A[i][j]*B[j]
  if tmp+C > 0:
    ans +=1
    
print(ans)

Fixed code:
N,M,C = map(int,input().split())
B = list(map(int,input().split()))
A=[0]*N
ans=0
tmp=0

for i in range(N):
  tmp=0
  A[i]= list(map(int,input().split()))
  for j in range(M):
    tmp += A[i][j]*B[j]
  if tmp+C > 0:
    ans +=1
    
print(ans)
Buggy code:
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
a = [[int(i) for i in input().split()] for i in range(n)]
condition = 0
count = 0
for i in range(n):
  for k in range(m):
    condition += a[i][k] * b[k]
  if condition + c > 0:
    count += 1
print(int(count))

Fixed code:
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
a = [input().split() for i in range(n)]
count = 0
for i in range(n):
  condition = 0
  for k in range(m):
    condition += int(a[i][k]) * b[k]
  if condition + c > 0:
    count += 1
print(int(count))
Buggy code:
N,M,C=map(int, input().split())
B = list(map(int,input().split()))

ans = 0
for i in range(N):
  A = list(map(int, input().split()))
  score = C
  for j in range(M):
    score += A[i] * B[i]
  if(score > 0):
    ans += 1
print(ans)

Fixed code:
N,M,C=map(int, input().split())
B = list(map(int,input().split()))

ans = 0
for i in range(N):
  A = list(map(int, input().split()))
  score = C
  for j in range(M):
    score += A[j] * B[j]
  if(score > 0):
    ans += 1
print(ans)
Buggy code:
N, M, C = map(int, input().split())
B = [int(x) for x in input().split() ]
A = []
for i in range(N):
    A += [ [ int(x) for x in input().split() ] ]

cnt = 0

for i in A:
    print (i)
    tmp = 0
    for j, b in zip(i, B):
        tmp += j*b
    tmp += C
    if tmp > 0:
        cnt += 1

print (cnt)


Fixed code:
N, M, C = map(int, input().split())
B = [int(x) for x in input().split() ]
A = []
for i in range(N):
    A += [ [ int(x) for x in input().split() ] ]

cnt = 0

for i in A:
    tmp = 0
    for j, b in zip(i, B):
        tmp += j*b
    tmp += C
    if tmp > 0:
        cnt += 1

print (cnt)
Buggy code:
n, m, c = map(int, input().split())
b = map(int, input().split())
counter = 0
for i in range(n):
  a = map(int, input().split())
  if sum([b[i]*a[i] for i in range(m)]) + c > 0:
    counter += 1
print(counter)

Fixed code:
n, m, c = map(int, input().split())
b = list(map(int, input().split()))
counter = 0
for i in range(n):
  a = list(map(int, input().split()))
  if sum([b[i]*a[i] for i in range(m)]) + c > 0:
    counter += 1
print(counter)
Buggy code:
n, m, c = map(int, input().split())
b = map(int, input().split())
count = 0

for i in range(n):
  a = map(int, input().split())
  for j in range(m):
    if 0 < a[m] * b[m] + c:
      count += 1
print(count)

Fixed code:
n, m, c = map(int, input().split())
b = list(map(int, input().split()))
count = 0
 
for i in range(n):
  a = list(map(int, input().split()))
  p = c
  for j in range(m):
  	p += a[j] * b[j]
  if 0 < p:
    count += 1
print(count)
Buggy code:
N,M,C = map(int, input().split())
B = [int(_) for _ in input().split()]

count = 0
for i in range(len(N)):
  A = [_ for _ in input().split()] 
  sum = 0
  for j in range(M):
    sum = B[j]*A[j]
  if sum-C > 0:
    count += 1

print(count)

Fixed code:
N,M,C = map(int, input().split())
B = [int(_) for _ in input().split()]

count = 0
for i in range(N):
  A = [int(_) for _ in input().split()] 
  sum = 0
  for j in range(M):
    sum += B[j]*A[j]
  if sum+C > 0:
    count += 1

print(count)
Buggy code:
N, M, C = list(map(int, input().split()))
B = list(map(int, input().split()))
A = list([])
for i in range(N):
    A.append(list(map(int, input().split())))

cnt = 0
for i in range(N):
    print("A= " + str(A[i]))
    print("B= " + str(B))
    print("C= " + str(C))
    ev = 0
    for j in range(M):
        ev = ev + A[i][j] * B[j]
    ev = ev + C
    if(ev > 0):
        cnt = cnt + 1

print(cnt)


Fixed code:
N, M, C = list(map(int, input().split()))
B = list(map(int, input().split()))
A = list([])
for i in range(N):
    A.append(list(map(int, input().split())))

cnt = 0
for i in range(N):
#    print("A= " + str(A[i]))
#    print("B= " + str(B))
#    print("C= " + str(C))
    ev = 0
    for j in range(M):
        ev = ev + A[i][j] * B[j]
    ev = ev + C
    if(ev > 0):
        cnt = cnt + 1

print(cnt)
Buggy code:
N, M, C = list(map(int, input().split()))
b_li = list(map(int, input().split()))
ct = 0
for i in range(N):
    a_li = list(map(int, input().split()))
    total = 0
    for a,b in zip(a_li, b_li):
        total += a * b
    if total + C > 0:
        print(i)
        ct += 1

if ct == 0:
    print(0)

Fixed code:
N, M, C = list(map(int, input().split()))
b_li = list(map(int, input().split()))
ct = 0
for i in range(N):
    a_li = list(map(int, input().split()))
    total = 0
    for a,b in zip(a_li, b_li):
        total += a * b
    if total + C > 0:
        ct += 1

print(ct)
Buggy code:
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
A = [list(map(int, input().split())) for i in range(N)]
count = 0
cal = 0
for i in range(N):
    for k in range(M):
        cal = A[i][k]*B[k]
    if cal + C > 0:
            count += 1
print(count)

Fixed code:
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
A = [list(map(int, input().split())) for i in range(N)]
count = 0
cal = 0
for i in range(N):
    for k in range(M):
        cal += A[i][k]*B[k]
    if cal + C > 0:
        count += 1
        cal = 0
    else: 
    	cal =0
print(count)
Buggy code:
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
a = 0
sum = 0
for i in range(N):
	A = list(map(int, input().split()))
    for j in range(M):
        sum += A[i][j] * B[j]
    if sum + C > 0:
        a += 1
        sum = 0
    else :
        sum = 0
print(a)

Fixed code:
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
A = [list(map(int, input().split())) for i in range(N)]
a = 0
sum = 0
for i in range(N):
    for j in range(M):
        sum += A[i][j] * B[j]
    if sum + C > 0:
        a += 1
        sum = 0
    else :
        sum = 0
print(a)
Buggy code:
n,m,c = map(int,input().split())
b = map(int,input()split())
cnt = 0
sum = 0
for i in range(n):
  a = map(int,input().split())
  for j in range(m):
    sum += (a[j]*b[j])
    sum += c
  if sum > 0:
    cnt += 1
  else:
    pass
print(cnt)

Fixed code:
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
cnt = 0
for i in range(n):
  a = list(map(int,input().split()))
  sum = 0
  for j in range(m):
    sum += (a[j]*b[j])
  sum += c
  if sum > 0:
    cnt += 1
  else:
    pass
print(cnt)
Buggy code:
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
cnt = 0
for i in range(M):
  A = list(map(int, input().split()))
  tmp = 0
  for j in range(N):
    tmp += A[j]*B[j]
  tmp += C
  if tmp > 0:
    cnt += 1
    
print(cnt)
               

Fixed code:
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
cnt = 0
for i in range(N):
  A = list(map(int, input().split()))
  tmp = 0
  for j in range(M):
    tmp += A[j]*B[j]
  tmp += C
  if tmp > 0:
    cnt += 1
    
print(cnt)
Buggy code:
n,m,c = map(int,input().split())
ls1 = list(map(int,input().split()))
ls2 = [list(map(int,input().split())) for i in range(n)]
print(ls1)
print(ls2)
ls = []
for i in range(n):
    a = 0
    for j in range(m):
        a += ls2[i][j]*ls1[j]
    a += c
    if a > 0:
        ls.append(1)
print(len(ls))

Fixed code:
n,m,c=map(int,input().split())
ls1 = list(map(int,input().split()))
ls2 = [list(map(int,input().split())) for i in range(n)]
ls = []
for i in range(n):
    a = 0
    for j in range(m):
        a += ls2[i][j]*ls1[j]
    a += c
    if a > 0:
        ls.append(1)
print(len(ls))
Buggy code:
N,M,C = map(int, input().split())
B = map(int, input().split())
A = []

for i in range(N):
	A[i] = map(int, input().split())

ans = 0

for i in range(N):
	tmp = 0
	for n in range(M):
		tmp += A[i][n]*B[n]
	if(tmp+C>0):
		ans += 1

print(ans)


Fixed code:
N,M,C = map(int, input().split())
B = list(map(int, input().split()))
A = [list(map(int, input().split())) for i in range(N)]

ans = 0
for i in range(N):
    tmp = 0
    for j in range(M):
        tmp += A[i][j]*B[j]
    tmp += C
    if tmp > 0:
        ans += 1
print(ans)
Buggy code:
N,M,C = map(int, input().split())
B = map(int, input().split())
A = [[0 for i in range(M)] for j in range(N)]

for i in range(N):
	A[i] = map(int, input().split())

ans = 0

for i in range(N):
	tmp = 0
	for n in range(M):
		tmp += A[i][n]*B[n]
	if(tmp+C>0):
		ans += 1

print(ans)


Fixed code:
N,M,C = list(map(int, input().split()))
B = list(map(int, input().split()))
A = []

for i in range(N):
	A.append(list(map(int, input().split())))

ans = 0

for i in range(N):
	tmp = 0
	for j in range(M):
		tmp = tmp + A[i][j]*B[j]
	if(tmp+C>0):
		ans += 1

print(ans)
Buggy code:
s=input().split()
n=int(s[0]);m=int(s[1]);c=int(s[2])
b=input().split();a=[];ans=0
for i in range n : a.append(input().split())
for i in range n :
  temp=0
  for j in range m : temp+=int(a[i][j])*int(b[j])
  if temp+c>0 : ans+=1
print(ans)

Fixed code:
s=input().split()
n=int(s[0]);m=int(s[1]);c=int(s[2])
b=input().split();a=[];ans=0
for i in range(n) : a.append(input().split())
for i in range(n) :
  temp=0
  for j in range(m) : temp+=int(a[i][j])*int(b[j])
  if temp+c>0 : ans+=1
print(ans)
Buggy code:
N,M,C = map(int,input().split())
res =0
B = input().split()
B = [int(i) for i in B]
for i in range(N):
  a = input().split()
  a = [int(j) for j in a]
  A = 0
  for j in range(M):
    A = A +a[j]*B[j]
  A =A+C
  if A == 0:
    res +=1
print(res)

Fixed code:
N,M,C = map(int,input().split())
res =0
B = input().split()
B = [int(i) for i in B]
for i in range(N):
  a = input().split()
  a = [int(j) for j in a]
  A = 0
  for j in range(M):
    A = A +a[j]*B[j]
  A =A+C
  if A > 0:
    res +=1
print(res)
Buggy code:
"""Boot-camp-for-Beginners_Easy005_B_Can-you-solve-this_25-August-2020.py"""

N, M, C = map(int, input().split())
B = list(map(int, input().split()))
A = list(list(map(int, input().split())) for i in range(N))

count=0
for i in range(N):
    s=0
    for j in range(len(B)):
        s+=B[j]*A[i][j]
    print(s)
    if s+C>0:
        count+=1
print(count)

Fixed code:
"""Boot-camp-for-Beginners_Easy005_B_Can-you-solve-this_25-August-2020.py"""

N, M, C = map(int, input().split())
B = list(map(int, input().split()))
A = list(list(map(int, input().split())) for i in range(N))

count=0
for i in range(N):
    s=0
    for j in range(len(B)):
        s+=B[j]*A[i][j]
    if s+C>0:
        count+=1
print(count)
Buggy code:
n, m, c = map(int, input().split())
b = [int(x) for x in input().split()]
ans = 0
for _ in range(n):
  if sum([b[i] * int(x) for i, x in enumerate(input().split())]) > c:
    ans += 1
print(ans)

Fixed code:
n, m, c = map(int, input().split())
b = [int(x) for x in input().split()]
ans = 0
for _ in range(n):
    if sum([b[i] * int(x) for i, x in enumerate(input().split())]) + c > 0:
        ans += 1
print(ans)
Buggy code:
N,M,C = map(int, input().split())
B = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(N)]


count = 0
for i in A:
  t = C
  for a,b in zip(i, B):
      t += a * b
      if t > 0:
        count += 1
print(count)

Fixed code:
N,M,C = map(int, input().split())
B = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(N)]


count = 0
for i in A:
  t = C
  for a,b in zip(i, B):
      t += a * b
  if t > 0:
      count += 1
print(count)
Buggy code:
n ,m, c = map(int, input().split())
B = list(map(int, input().split()))
A = [list(map(int,input().split())) for i in range(n)] 
    

count = 0
for i in A:
  numberSum = c
  for a, b in zip(i, B):
    numberSum += (a * b)  
    if numberSum > 0:
      count += 1
print(count)
  

Fixed code:
n ,m, c = map(int, input().split())
B = list(map(int, input().split()))
A = [list(map(int,input().split())) for i in range(n)] 
    

count = 0
for i in A:
    numberSum = c
    for a, b in zip(i, B):
      numberSum += (a * b)  
    if numberSum > 0:
        count += 1
print(count)
Buggy code:
N,M,C=map(int,input().split())
B=list(map(int,input().split()))
X=0
Y=0
for i in range(N):
  A=list(map(int,input().split()))
  for i in range(N):
    Y+=A[i]*B[i]
  Y=Y+C
  if Y>0:
    X+=1
print(X)

Fixed code:
N,M,C=map(int,input().split())
B=list(map(int,input().split()))
X=0
for i in range(N):
  A=list(map(int,input().split()))
  Y=0
  for i in range(M):
    Y+=A[i]*B[i]
  Y=Y+C
  if Y>0:
    X+=1
  else:
    pass
print(X)
Buggy code:
n, m, c = map(int,input().split())
b = list (map(int,input().split()))
a = []
for i in range(n):
    A = list(map(int,input().split()))
    a.append(A)
ans = 0
print(a)
for i in range(n):
    z = a[i]
    Z = 0
    for l in range(len(z)):
        Z += z[l] * b[l]
    if Z + c > 0:
        ans += 1
print(ans)

Fixed code:
n, m, c = map(int,input().split())
b = list (map(int,input().split()))
a = []
for i in range(n):
    A = list(map(int,input().split()))
    a.append(A)
ans = 0
for i in range(n):
    z = a[i]
    Z = 0
    for l in range(len(z)):
        Z += z[l] * b[l]
    if Z + c > 0:
        ans += 1
print(ans)
Buggy code:
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
count = 0
for i in range(n):
    A = list(map(int,input().split()))
    for j in range(len(m)):
        ans = A_i[j]*b[j] + c
    if ans > 0:
        tmp += 1
print(tmp)


Fixed code:
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
count = 0
for i in range(n):
    A = list(map(int,input().split()))
    ans = 0
    for j in range(m):
        ans += A[j]*b[j]
    ans = ans + c
    if ans > 0:
        count+= 1
print(count)
Buggy code:
N, M, C = map(int, input().split())
B = [int(_) for _ in input().split()]
A = []
for i in range(N):
    A.append([int(_) for _ in input().split()])

right = 0

for i in range(N):
    src = 0
    for j in range(M):
        src += A[i][j]*B[j]
    if src + C >0 :
        right + =1

print(right)

Fixed code:
N, M, C = map(int, input().split())
B = [int(_) for _ in input().split()]
A = []
for i in range(N):
    A.append([int(_) for _ in input().split()])

right = 0

for i in range(N):
    src = 0
    for j in range(M):
        src += A[i][j]*B[j]
    if src+C>0:
        right+=1

print(right)
Buggy code:
n , m , c = map(int,input().split())
b = list(map(int,input().split()))
a = []
count = 0
x = 0

for i in range(n):
    a.append(list(map(int,input().split())))
#print(a)


for i in range(n):

    for j in range(m):
        x += a[i][j]*b[j]
    if x+c > 0:
        count += 1
print(count)

Fixed code:
n , m , c = map(int,input().split())
b = list(map(int,input().split()))
a = []
count = 0
x = 0

for i in range(n):
    a.append(list(map(int,input().split())))
#print(a)


for i in range(n):
    x = 0
    for j in range(m):
        x += a[i][j]*b[j]
    if x+c > 0:
        count += 1
print(count)
Buggy code:
n, m, c = map(int, input().split())
b = list(map(int, input().split()))
ans = 0
code = 0

for i in range(n):
    a = list(map(int, input().split()))
    
    for j in range(m):
        code += a[j] * b[j]
    
    code += c
    if code > 0:
        ans += 1
        
print(ans)


Fixed code:
n, m, c = list(map(int, input().split()))
b = list(map(int, input().split()))
a = [list(map(int, input().split())) for _ in range(n)]

ans = 0
for i in range(n):
    code_num = 0
    for j in range(m):
        code_num += b[j] * a[i][j]
    code_num += c
    if code_num > 0:
        ans += 1
print(ans)
Buggy code:
N,M,C = map(int,input().split())
B = [int(x) for x in input().split()]

count = 0
for i in range(N):
  temp = [int(x) for x in input().split()]
  total = [B[i]*temp[i] for i in range(M)]
  if(total > 0 ):
    count+=1
  
  


Fixed code:
N,M,C = map(int,input().split())
B = [int(x) for x in input().split()]
 
count = 0
for i in range(N):
  temp = [int(x) for x in input().split()]
  total = [B[i]*temp[i] for i in range(M)]
  if((sum(total) + C) > 0 ):
    count+=1
print(count)
Buggy code:
n, m, c = map(int, input.split())
b = list(map(int, input.split()))
ans = 0
code = 0

for i in range(n):
    for j in range(m):
        
        a = list(map(int, input.split()))
        code += a[i] * b[i]
    
    code -= 10
    if code >= 0:
        ans += 1
        
print(ans)

Fixed code:
n, m, c = map(int, input().split())
b = list(map(int, input().split()))
ans = 0
code = 0

for i in range(n):
    a = list(map(int, input().split()))
    
    for j in range(m):
        code += a[j] * b[j]
    
    code += c
    if code > 0:
        ans += 1
    code = 0
        
print(ans)
Buggy code:
n, m, c = map(int, input().split())
b = list(map(int, input().split()))
ans = 0
code = 0

for i in range(n):
    a = list(map(int, input().split()))
    
    for j in range(m):
        code += a[j] * b[j]
    
    code -= c
    if code > 0:
        ans += 1
        
print(ans)


Fixed code:
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
a = [list(map(int,input().split())) for i in range(n)]
cnt = 0
for i in range(n):
    ans = c
    for j in range(m):
        ans += b[j]*a[i][j]
    if ans >0: cnt+= 1
print(cnt)
Buggy code:
n, m, c = map(int, input().split())
b = list(map(int, input().split()))
a = [list(map(int, input().split())) for i in range(n)]

ans = 0
l = []

for i in range(n):
  for j in range(m):
    l.append(a[i][j] * b[j]) 
    if sum(l) + c > 0:
      ans += 1
      l.clear()

print(ans)


Fixed code:
n, m, c = map(int, input().split())
b = list(map(int, input().split()))
a = [list(map(int, input().split())) for i in range(n)]

ans = 0
l = []

for i in range(n):
  for j in range(m):
    l.append(a[i][j] * b[j]) 
  if sum(l) + c > 0:
      ans += 1
      l.clear()
  else:
      l.clear()

print(ans)
Buggy code:
N,M,C=map(int,input().split())
B=list(map(int,input().split())
cnt = 0
for i in range(N):
    tmp=0
    A=list(map(int,input().split())
    for j in range(M):
        tmp+=A[j]*B[j]
    tmp+=C
    if tmp>0:
        cnt+=1
    else:
        cnt+=0
print(cnt)

Fixed code:
N,M,C=map(int,input().split())
B=list(map(int,input().split()))
cnt=0
for i in range(N):
    tmp=0
    A=list(map(int,input().split()))
    for j in range(M):
        tmp+=A[j]*B[j]
    tmp+=C
    if tmp>0:
        cnt+=1
    else:
        cnt+=0
print(cnt)
Buggy code:
N,M,C=[int(s) for s in input().split(" ")]
B=[int(s) for s in input().split(" ")]
A=[input().split(" ") for _ in range(N)]

count=0
for i in range(N):
  sum=0
  for j in range(M):
    sum+=int(A[i][j])*B[j]
  sum+=C
  print(sum)
  if sum>0:
    count=count+1
 

print(count)

Fixed code:
N,M,C=[int(s) for s in input().split(" ")]
B=[int(s) for s in input().split(" ")]
A=[input().split(" ") for _ in range(N)]

count=0
for i in range(N):
  sum=0
  for j in range(M):
    sum+=int(A[i][j])*B[j]
  sum+=C
  if sum>0:
    count=count+1
 

print(count)
Buggy code:
N,M,C=map(int, input().split())
B=list(map(int, input().split()))
A=[list(map(int, input().split())) for n in range(N)]

def Sof(a):
  d=C
  for m in range(M):
    d+=a[m]*b[m]
  return d > 0

co=0
for i in range(N):
  if(Sof(A[i])):
    co+=1

print(co)

Fixed code:
N,M,C=map(int, input().split())
B=list(map(int, input().split()))
A=[list(map(int, input().split())) for n in range(N)]

def Sof(a):
  d=C
  for m in range(M):
    d+=a[m]*B[m]
  return d > 0

co=0
for i in range(N):
  if(Sof(A[i])):
    co+=1

print(co)
Buggy code:
N, M, C = map(int, input().split)
Blis = [int(x) for x in input().split()]
k = 0
for i in range(N):
  Alis = [int(x) for x in input().split()]
  total = o
  for j in range(M):
    total = total + Alis[j]*Blis[j]
  total = total + C
  if total > 0:
    k = k + 1
print(k)    

Fixed code:
N, M, C = map(int, input().split())
Blis = [int(x) for x in input().split()]
k = 0
for i in range(N):
  Alis = [int(x) for x in input().split()]
  total = 0
  for j in range(M):
    total = total + (Alis[j])*(Blis[j])
  total = total + C
  if total > 0:
    k = k + 1
print(k)
Buggy code:
n,m,c=map(int,input().split())
b=list(map(int, input().split()))
a=[list(map(int,input().split())) for _ in range(n)]

cnt=0
cal=c
for i in range(n):
    for j in range(m):
        cal += a[i][j]*b[j]
    if cal>0:
        cnt+=1
    

print(cnt)


Fixed code:
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
a = [list(map(int,input().split())) for i in range(n)]
cnt = 0
ans = 0
for i in range(n):
    for j in range(m):
        cnt += a[i][j]*b[j]
    cnt += c
    if cnt > 0:
        ans += 1
    cnt = 0
print(ans)
Buggy code:
n, m, c = map(int, input().split())
a = [[0 for i in range(m)] for j in range(n)]
b = [0 for i in range(m)]
for i in range(m):
    b[i] = int(input())
for i in range(n):
    for j in range(m):
        a[i][j] = int(input())

count = 0
for i in range(n):
    x = 0
    for j in range(m):
        x += a[i][j] * b[j]
    x += c

    if x > 0:
        count += 1
            
print(count)


Fixed code:
n, m, c = map(int, input().split())
a = []
b = list(map(int, input().split()))

for i in range(n):
    a.append(list(map(int, input().split())))

count = 0
for i in range(n):
    x = 0
    for j in range(m):
        x += a[i][j] * b[j]
    x += c

    if x > 0:
        count += 1
            
print(count)