Problem:
 Score : 200 points    Problem Statement There are N pieces of source code. The characteristics of the i -th code is represented by M integers A_{i1}, A_{i2}, ..., A_{iM} .  Additionally, you are given integers B_1, B_2, ..., B_M and C .  The i -th code correctly solves this problem if and only if A_{i1} B_1 + A_{i2} B_2 + ... + A_{iM} B_M + C > 0 .  Among the N codes, find the number of codes that correctly solve this problem.      Constraints  All values in input are integers.  1 \leq N, M \leq 20  -100 \leq A_{ij} \leq 100  -100 \leq B_i \leq 100  -100 \leq C \leq 100         Input Input is given from Standard Input in the following format:  N  M  C  B_1  B_2  ...  B_M  A_{11}  A_{12}  ...  A_{1M}  A_{21}  A_{22}  ...  A_{2M}  \vdots  A_{N1}  A_{N2}  ...  A_{NM}       Output Print the number of codes among the given N codes that correctly solve this problem.        Sample Input 1 2 3 -10
1 2 3
3 2 1
1 2 2      Sample Output 1 1  Only the second code correctly solves this problem, as follows:   Since 3 \times 1 + 2 \times 2 + 1 \times 3 + (-10) = 0 \leq 0 , the first code does not solve this problem.  1 \times 1 + 2 \times 2 + 2 \times 3 + (-10) = 1 > 0 , the second code solves this problem.        Sample Input 2 5 2 -4
-2 5
100 41
100 40
-3 0
-6 -2
18 -13      Sample Output 2 2       Sample Input 3 3 3 0
100 -100 0
0 100 100
100 100 100
-100 100 100      Sample Output 3 0  All of them are Wrong Answer . Except yours.

Solution (Python):
N,M,C=map(int,input().split())
B=list(map(int,input().split()))
A=[]
for i in range(N):
    A.append(list(map(int,input().split())))
cnt=0
for i in range(N):
    total=0
    for j in range(M):
        total+=A[i][j]*B[j]
    if total +C > 0 :
        cnt+=1

print(cnt)

Solution (Python):
n,m,c=map(int,input().split())
b=list(map(int,input().split()))

count=0
sum=0

for i in range(n):
    a=list(map(int,input().split()))
    for j in range(m):
        sum+=a[j]*b[j]

    sum+=c
    if sum>0:
        count+=1
    sum=0

print(count)

Solution (Python):
N, M, C = [int(x) for x in input().split()]
B = [int(x) for x in input().split()]
A = []
for i in range(N):
    A.append([int(x) for x in input().split()])

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

print(count)

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

Solution (Python):
import sys

def main():
    inp = [[i for i in map(int, line.rstrip().split())] for line in sys.stdin.readlines()]
    res = [1 for i in range(inp[0][0])
           if sum(
            [inp[1][j]*inp[i + 2][j] for j in range(inp[0][1])]) + inp[0][2] > 0]

    print(sum(res))

if __name__ == '__main__':
    sys.exit(main())

Solution (Python):
n,m,c = map(int,input().split(' '))


blist = list(map(int,input().split(' ')))
count_t = 0

for i in range(n):
  nlist=list(map(int,input().split(' ')))
  bn = 0
  for j in range(m):
    bn += blist[j]*nlist[j]

  if (bn + c) > 0:
    count_t += 1
print(count_t)

Solution (Python):
N, M, C = (int(i) for i in input().split())
tage_lists = [int(i) for i in input().split()] 

result = 0
for _ in range(N):
  code_list = [int(i) for i in input().split()]
  
  total = 0
  for count, num in enumerate(code_list):
    total += num * tage_lists[count]
  
  if(total + C > 0):
    result += 1

print(result)

Solution (Python):
n, m, c = [int(i) for i in input().split(" ")]
a_list = input().split(" ")
ia = 0

for i in range(n):
    b_list = input().split(" ")
    ans = c
    for j in range(m):
        ans += int(a_list[j]) * int(b_list[j])
    if ans > 0:
        ia += 1

print(ia)

Solution (Python):
N,M,C=(int(i) for i in input().split())
lstb=[int(i) for i in input().split()]
L=[[int(i) for i in input().split()] for j in range(N)]
a=0
for i in range(N):
  b=0
  for j in range(M):
    b+=lstb[j]*L[i][j]
    
  if b+C>0:
      a+=1
print(a)

Solution (Python):
N,M,C = map(int, input().split())
A = list()
B = list(map(int, input().split()))
cnt = 0

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

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

print(cnt)

Solution (Python):
import numpy as np

N, M, C = map(int, input().split())
B = np.array(list(map(int, input().split())))

cnt = 0
for i in range(N):
    a = np.array(list(map(int, input().split())))
    if np.sum(a * B) + C > 0:
        cnt += 1

print(cnt)

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

def judge(x,y,z):
    rt=0
    for i in range(len(x)):
        rt+=x[i]*y[i]
    return rt+z
ans=0
for i in range(n):
    jj=judge(a[i],b,c)
    
    if jj>0:
        ans+=1
print(ans)

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

res = []
for values in A:
  sum_res = 0
  for i in range(len(values)):
	  sum_res += values[i] * B[i]
  sum_res += C
  
  if sum_res > 0:
    res.append(1)
  else:
    res.append(0)
print(sum(res))

Solution (Python):
N,M,C = list(map(int,input().split()))
B = list(map(int,input().split()))

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

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

Solution (Python):


import sys


INF = float('inf')
MOD = 10 ** 9 + 7

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return input()


def main():
    n, m, c = LI()
    B = LI()

    res = 0
    for _ in range(n):
        A = LI()
        tmp = c
        for i in range(m):
            tmp += A[i] * B[i]
        if tmp > 0:
            res += 1

    return res


print(main())

Solution (Python):
def verify(A, B, C, M):
    n = 0
    for i in range(M):
        n += A[i]*B[i]
    if n + C > 0:
        return True
    return False


in1 = list(map(int, input().split()))
N = in1[0]
M = in1[1]
C = in1[2]

B = list(map(int, input().split()))

v = 0
for _ in range(N):
    A = list(map(int, input().split()))
    if verify(A, B, C, M): v += 1;

print(v)

Solution (Python):
def get_input_row():
  return [int(i) for i in input().split(" ")]

inp = input()
index = [int(a) for a in inp.split(" ")]
N = index[0]
M = index[1]
C = index[2]
B = [int(b) for b in input().split(" ")]
collect = 0
for i in range(N):
  row_data = get_input_row()
  val = sum([a * b for a, b in zip(row_data, B)]) + C
  collect += 1 if val > 0 else 0
print(collect)

Solution (Python):
from sys import stdin

N,M,C = map(int, input().split(' '))
B = stdin.readline().rstrip().split(' ')
A = [stdin.readline().rstrip().split(' ') for i in range(N)]

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

Solution (Python):
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 a in A:
    if sum(a_i*b_i for a_i, b_i in zip(a, B)) + C > 0:  
        count += 1

print(count)

Solution (Python):
n,m,c=[int(x) for x in input().split()]
b=[int(x) for x in input().split()]
count=0
for a in range(n):
    alist=[int(x) for x in input().split()]
    sum=0
    for i in range(m):
        sum+=b[i]*alist[i]
    if (sum+c)>0:
        count+=1
print(count)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
ans = 0


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

Solution (Python):
import numpy as np
N, M, C=map(int, input().split(' '))
B = list(map(int, input().split(' ')))
b = np.array(B)
A = []
for i in range(N):
    A.append(list(map(int, input().split(' '))))
a = np.array(A)
z = np.sum(a*b, axis=1) + C
print(np.sum(z>0))

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
A = []
count = 0
for i in range(N):
	A.append(list(map(int, input().split())))
for s in range(N):
	ans = 0
	for t in range(M):
		ans += A[s][t]*B[t]
	if(t == M - 1):
		ans += C
	if(ans > 0):
		count += 1
print(count)

Solution (Python):
tmp = [int(i) for i in raw_input().split()]

N = tmp[0]
M = tmp[1]
C = tmp[2]

B = [int(i) for i in raw_input().split()]

count = 0
sum = 0

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

Solution (Python):
n, m, c = map(int, input().split()) 
B = list(map(int, input().split())) 

num = 0
for i in range(0,n):
	A = list(map(int, input().split()))
	sum = 0 
	for j in range(0, m):
		sum += A[j]*B[j]
	
	sum += c	
	if(sum>0):
		num += 1
	
print(num)

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

Solution (Python):
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()))
    calc = sum( [(A[i] * B[i]) for i in range(M)] ) + C
    if calc > 0:
        count += 1
        
print(count)

Solution (Python):
N,M,C = map(int,input().split())
A_list = []
check = 0
kosuu = 0
B_list = list(map(int,input().split()))
for i in range(N):
    A_list = list(map(int,input().split()))
    check = 0
    for j in range(M):
        check += A_list[j]*B_list[j]
    if(check + C > 0):
        kosuu += 1
print(kosuu)

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

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

print(cnt)

Solution (Python):
import numpy as np
N,M,C= map(int,input().split())
list_B = np.array(list(map(int,input().split())))
cnt = 0
for i in range(N):
    list_Ai = np.array(list(map(int, input().split())))
    if np.dot(list_B,list_Ai) > -C:
        cnt += 1

print(cnt)

Solution (Python):
n,m,c = list(map(int,input().split()))
b = list(map(int,input().split()))
zz = 0
for i in range(n):
    o = 0
    q = list(map(int,input().split()))

    for j in range(m):
        o += b[j] * q[j]

    if(o+c > 0):
        zz += 1

print(zz)

Solution (Python):
n, m, c = map(int, input().split())

B = [int(i) for i in input().split()]
count = 0
for j in range(n):
    sum = c
    A = [int(i) for i in input().split()]
    for i in range(m):
        sum += A[i] * B[i] 
    if sum > 0:
        count += 1

print(count)

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

SUM = C
CNT = 0

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

print(CNT)

Solution (Python):
n, m, c = input().split()
N = int(n)
M = int(m)
C = int(c)

array = list(map(int, input().strip().split(' ')))

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

count = 0
for i in range(N):
    calc = 0
    for j in range(M):
        calc += A[i][j] * array[j]
    if 0 < calc + C:
        count += 1
print(count)

Solution (Python):
li = []
d = 0
co = 0
inp = [int(i) for i in input().split()]
inp2 = [int(i) for i in input().split()]
for k in range(inp[0]):
  li.append([int(i) for i in input().split()])
  
  
for g in li:
  for f in range(inp[1]):
    d += g[f] * inp2[f]
  d += inp[2]
  if d > 0:
    co += 1
  d = 0
print(co)

Solution (Python):
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)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
hoge = [list(map(int, input().split())) for _ in range(N)]
C_m = [C for _ in range(M)]

out = []
res = 0
for i in range(N):
  for j in range(M):
    res += (hoge[i][j]* B[j])
  out.append((res+C) > 0)
  res = 0

  
print(sum(out))

Solution (Python):



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

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

ok_count = 0

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

    sum = c
    for j in range(m):
        sum += a[i][j] * b[j]

    ok_count += 1 if sum > 0 else 0

print(ok_count)

Solution (Python):
n, m ,c = map(int, input().split())
b = list(map(int, input().split()))
a = []
for i in range(n):
    a_next = list(map(int, input().split()))
    a.append(a_next)

ans = 0
sum = 0

for i in range(n):
    sum = 0
    for x, y in zip(a[i], b):
        sum += x*y
    if sum + c > 0:
        ans +=1
print(ans)

Solution (Python):
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()))
    sums = 0
    for j in range(M):
        sums += A[j]*B[j]
    sums+=C
    if sums > 0:
        count+=1
print(count)

Solution (Python):
import numpy as np
n, m, c = map(int, input().split(' '))
bs = list(map(int, input().split(' ')))
res = 0
for i in range(n):
  if np.dot(list(map(int, input().split(' '))),bs) + c > 0:
    res += 1

print(res)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
cnt = 0

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

    for j in range(M):
        ans_sum += A[j]*B[j]

    if ans_sum + C > 0:
        cnt += 1

print(cnt)

Solution (Python):
count = 0
N, M, C = map(int, input().split())
B = [int(i) for i in input().split()]
A = [list(map(int, input().split())) for l in range(N)]

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

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

Solution (Python):
N,M,C=map(int,input().split())
b_list = list(map(int, input().split())) 
a = []
for i in range(N):
    a.append(list(map(int, input().split())))

import numpy as np
b_list=np.array(b_list)
a=np.array(a)

ans=0
for i in range(N):
    if (sum(b_list*a[i])+C)>0:
        ans+=1
print(ans)

Solution (Python):
import numpy as np

N,M,C=list(map(int,input().split()))
B=np.array(list(map(int,input().split())))
A=np.zeros((N,M))
for i in range(N):
    A[i]=list(map(int,input().split()))
    
def calc(a):
    ret=0
    for i in range(M):
        ret+=a[i]*B[i]
    ret+=C
    if ret>0:
        return 1
    return 0

ans=0
for i in range(N):
    ans+=calc(A[i])
print(ans)

Solution (Python):
n,m,c = map(int,input().split())
seisu = list(map(int,input().split()))
count = 0
for i in range(n):
  source = list(map(int,input().split()))
  a = 0
  for j in range(m):
    a = a + source[j]*seisu[j]
  if a+c >= 1:
    count += 1
print(count)

Solution (Python):
N,M,C=[int(i) for i in input().split()]
B=[int(i) for i in input().split()]
n=0
for i in range(N):
  Ai = list(map(int, input().strip().split(' ')))
  S = C
  j = 0
  while j < M:
    S += Ai[j]*B[j]
    j += 1
  if S > 0 : n += 1
print(n)

Solution (Python):
N, M, C = map(int,input().split())
Bs = list(map(int,input().split()))

As = []
As += [[int(i) for i in input().split()] for _ in range(N)]

def tim(A):
    r = 0
    for i in range(M):
        r += A[i]*Bs[i]
    r += C
    return r > 0

print(sum([tim(A) for A in As]))

Solution (Python):
N,M,C = map(int, input().split())

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

print(ans)

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

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

ans=0
for i in A:
    sum=C
    for x in range(M):
        sum+=i[x]*B[x]
    if sum>0:
        ans+=1
print(ans)

Solution (Python):
n,m,c = map(int, input().split())

lstB = list(map(int, input().split()))

lstA=[]
for i in range(n):
    lstA.append(list(map(int,input().split())))

cnt=0
sum=0
for j in range(n):
    for k in range(m):
        ans=lstA[j][k]*lstB[k]
        sum=sum+ans
    if sum+c>0:
        cnt+=1
    sum=0

print(cnt)

Solution (Python):
from itertools import starmap
n,m,c=map(int,input().split())
b=list(map(int,input().split()))
k=0
for _ in range(n):
    a=list(map(int,input().split()))
    w=sum(starmap(lambda i,j:i*j,zip(a,b)))+c
    if w>0:
        k+=1
print(k)

Solution (Python):
n, m, c = map(int, input().split())
bm = list(map(int, input().split()))
anm = [list(map(int, input().split())) for _ in range(n)]

res = 0
count = 0
for i in range(n):
    res = 0
    for j in range(m):
        res += anm[i][j]*bm[j]

    res += c
    if res > 0:
        count += 1
print(count)

Solution (Python):
import numpy as np
N, M, C = map(int, input().split())
B = np.array(list(map(int, input().split())))
cnt = 0
for i in range(N):
    A = np.array(list(map(int, input().split())))
    if np.dot(A, B) + C > 0:
        cnt += 1
print(cnt)

Solution (Python):
N, M, C = list(map(int, input().split()))
B = list(map(int, input().split()))
ss = [list(map(int, input().split())) for _ in range(N)]
cnt = 0
for s in ss:
  t = 0
  for i, b in zip(s, B):
    t += i * b
  if (t+C) > 0:
    cnt += 1
print(cnt)

Solution (Python):
A = []
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
for i in range(N):
    A.append(list(map(int, input().split())))
ans = 0

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

Solution (Python):
def main():
    N,M,C = map(int, input().split())
    B = list(map(int, input().split()))
    Aij = [list(map(int, input().split())) for i in range(N)]
    
    
    cnt = 0
    wa = C
    for i in range(N):
        wa = C
        for j in range(M):
            wa =  wa + Aij[i][j]*B[j]
        if wa > 0:
            cnt = cnt + 1
    print(cnt)
    
main()

Solution (Python):
x = input()
y = x.split(" ")
parameters = [int(i) for i in y]
N = parameters[0]
M = parameters[1]
C = parameters[2]
x = input()
y = x.split(" ")
B = [int(i) for i in y]
i = N
count = 0
A = [[0] * M for i in range(N)]

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

print(right)

Solution (Python):
N,M,C = map(int,input().split(' '))
B=list(map(int,input().split(' ')))

ans =0
for _ in range(N):
    A=list(map(int,input().split(' ')))
    AB = [x * y for (x, y) in zip(A, B)]
    if sum(AB) + C >0 :
        ans+=1

print(ans)

Solution (Python):
N, M, C = map(int, input().split())
Bli = list(map(int,input().split()))
Ali = [list(map(int, input().split())) for _ in range(N)]

ans = 0

for A in Ali:
    sumNum = 0
    for num, a in enumerate(A):
        sumNum += a * Bli[num]
        
    if sumNum + C > 0:
        ans += 1

print(ans)

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

Solution (Python):
n,m,c=list(map(int,input().split(" ")))
bl=list(map(int,input().split(" ")))
al=[[0 for i in range(m)] for j in range(n)]
for i in range(n):
    al[i]=list(map(int,input().split(" ")))
ans=0
for i in range(n):
    inp=0
    for j in range(m):
        inp+=al[i][j]*bl[j]
    if inp>-c:
        ans+=1
print(ans)

Solution (Python):
N, M, C = map(int, input().split())
b = list(map(int, input().split()))
a = []
for i in range(N):
        a.append(list(map(int, input().split())))

cnt = 0
for i in range(N):
    s = 0
    for j in range(M):
        s += a[i][j] * b[j]

    s = s + C
    if s > 0:
        cnt += 1

print(cnt)

Solution (Python):
N,M,C =map(int,input().split())
List=[[int(j) for j in input().split()] for i in range(N+1)]
ANS = 0


for i in range(1,N+1):
    row_sum = 0
    for j in range(M):
        
        row_sum += List[i][j] * List[0][j]
    
    if row_sum + C > 0:
        ANS +=1

print(ANS)

Solution (Python):
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())))
c=0
for i in range(N):
    res=0
    for a,b in zip(A[i],B):
        res+=a*b
    res+=C
    if(res>0):
        c+=1

print(c)

Solution (Python):
n, m, c = map(int, input().split())
numsB = list(map(int, input().split()))

count = 0

for i in range(n):
    total = c
    numsA = list(map(int, input().split()))
    for j in range(m):
        total += numsA[j] * numsB[j]
    if total > 0:
        count += 1

print(count)

Solution (Python):
init = input().split(' ')
init = [int(i) for i in init]
n,m,c = init[0],init[1],init[2]
b = input().split(' ')
b = [int(i) for i in b]

count = 0
try:
	while True:
		inp1 = input().split(' ')
		inp1 = [int(i) for i in inp1]
		score = c
		for j in range(m):
			score += inp1[j]*b[j]
		if score > 0:
			count+= 1
except:
	pass

print(count)

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

print(ans)

Solution (Python):
def ok(aa, bb, c):
    total = 0
    for j,a in enumerate(aa):
        total += a * bb[j]
    total += c
    return total > 0


def solver(aa, bb, c):
    count = 0
    for a in aa:
        if ok(a, bb, c):
            count += 1
    return count

if __name__ == '__main__':

    n, m, c = map(int, input().split())
    bb = list(map(int, input().split()))
    aa = []
    for _ in range(n):
        aa.append(map(int, input().split()))

    ans = solver(aa, bb, c)
    print(ans)

Solution (Python):
def read():
  return int(input())

def reads():
  return [int(x) for x in input().split()]

N, M, C = reads()
B = reads()
ans = 0
for _ in range(N):
  A = reads()
  if sum(A[i] * B[i] for i in range(M)) + C > 0:
    ans += 1
print(ans)

Solution (Python):
import numpy as np
N,M,C = map(int, input().split())
B = input().split()
Bs = np.array([float(b) for b in B])
A = np.zeros((N,M))
for i in range(N):
    A_i = input().split()
    A_i = [float(a) for a in A_i]
    A[i] = A_i
W = np.dot(A,Bs.T)
print(len(W[W+C>0]))

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
A_list = [list(map(int, input().split())) for _ in range(N)]

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

print(count)

Solution (Python):

N,M,C=map(int,input().split())
B=[int(_) for _ in input().split()]
A=[]
count=0
sum=0
for i in range(N):
    A=[int(_) for _ in input().split()]

    for j in range(M) :
       sum+=B[j]*A[j]

    sum+=C
    if sum>0:
       count+=1
    sum=0
    A=[]

print(count)

Solution (Python):


N, M, C = map(int, raw_input().split())
B = map(int, raw_input().split())

count = 0
for n in range(N):
    A = map(int, raw_input().split())
    sum = 0
    for m in range(M):
        sum += A[m] * B[m]

    if sum > -C:
        count += 1

print count

Solution (Python):
import numpy as np

parameter = list(map(int,input().split()))
b = list(map(int,input().split()))
B = np.array(b)
X=[]
for i in range(1,parameter[0]+1):
    a = list(map(int,input().split()))
    A = np.array(a)
    D = np.dot(A,B)+parameter[2]
    if D>0:
        X.append(1)
print(len(X))

Solution (Python):
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()))

    sum = C
    for j in range(M):
        sum += A[j] * B[j]

    if sum > 0:
        ans += 1

print(ans)

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

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

Solution (Python):
a = input().split()
b = input().split()
count = 0
for i in range(int(a[0])):
  ans = 0
  temp = []
  temp = input().split()
  for j in range(len(temp)):
    ans = ans + int(temp[j])*int(b[j])
  ans = ans + int(a[2])
  if ans> 0:
    count+=1
print(count)

Solution (Python):
n,m,c=[int(x) for x in input().split()]
b=[int(x) for x in input().split()]
ans=0
for _ in range(n):
    ai=[int(x) for x in input().split()]
    if sum([ai[i]*b[i] for i in range(m)])+c>0:
        ans+=1
print(ans)

Solution (Python):
N,M,C = map(int,input().split())
B_lst = list(map(int,input().split()))
count=0
for _ in range(N):
	A_lst = list(map(int,input().split()))
	ans = C
	for a,b in zip(A_lst,B_lst):
		ans += a*b
	if ans > 0:
		count += 1
print(count)

Solution (Python):
import numpy as np

n, m, c = [int(x) for x in input().split()]
bs = np.array([int(x) for x in input().split()])
ass = np.array([[int(x) for x in input().split()] for _ in range(n)])

print((np.dot(ass, bs)+c > 0).sum())

Solution (Python):




N, M, C = map(int, input().split())
Bn = list(map(int, input().split()))
listA =[]

for i in range(N):
    listA.append(input().split())


cnt = 0
for i in range(N):
    tmp = 0
    for j in range(M):
        tmp += int(listA[i][j]) * int(Bn[j])

    if tmp + int(C) > 0:
        cnt += 1

print(cnt)

Solution (Python):
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) :
    sum = 0
    for j in range(M) :
        sum += A[i][j] * B[j]
    if sum + C > 0 :
        cnt += 1

print(cnt)

Solution (Python):
N, M, C = [ int(x) for x in input().split(' ')]
B = [ int(x) for x in input().split(' ')]
A = []
for i in range(N):
    A.append([ int(x) for x in input().split(' ')])

import numpy
count = 0
for i in range(N):
    if (numpy.dot(A[i], B) + C > 0):
        count += 1

print(count)

Solution (Python):
N,M,C=map(int,input().split())
b=[int(i) for i in input().split()]

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

cnt=0
for i in range(N):
    plus=0
    for j in range(M):
        plus+=a[i][j]*b[j]
        
        
        
    plus+=C
    if plus>0:
        cnt+=1
print(cnt)

Solution (Python):
N, M, C = list(map(int, input().split()))
B_list = list(map(int, input().split()))
ans = 0

for _ in range(N):
    judge_val = C
    A_list = list(map(int, input().split()))
    for i in range(M):
        judge_val += A_list[i] * B_list[i]
    if judge_val > 0:
        ans += 1

print(ans)

Solution (Python):
total = 0
x = [int(i) for i in input().split()]
y = [int(i) for i in input().split()]
for i in range(x[0]):
  z = [int(k) for k in input().split()]
  cnt = 0
  for j in range(len(z)):
    cnt += z[j]*y[j]
  if cnt + x[2] > 0:
    total+=1
print(total)

Solution (Python):
N, M, C = map(int, input().split())
B_list_str = input().split()
B_list = []
for b in B_list_str:
    B_list.append(int(b))
A_row_list = []

cnt = 0
for row in range(N):
    A_list_str = input().split()
    A_list = []
    for a in A_list_str:
        A_list.append(int(a))
    A_row_list.append(A_list)
    row_sum = 0
    for i in range(M):
        row_sum += A_list[i] * B_list[i]
    if row_sum + C > 0:
        cnt += 1
print(cnt)

Solution (Python):
n,m,c = map(int,input().split())

b = list(map(int,input().split()))

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

Solution (Python):
import numpy as np
 
n, m, c = map(int, input().split())
 
b = list(map(int, input().split()))
num = 0
 
for i in range(n):
  A = list(map(int, input().split()))
  npb = np.array(b)
  npA = np.array(A)
  if np.dot(npA.T, npb) + c > 0:
    num += 1
    
print(num)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
ans = 0
s = 0

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

Solution (Python):
N,M,C = map(int,input().split())
Blist = list(map(int,input().split()))
count = 0
for i in range(N):
    Alist = list(map(int,input().split()))
    a = 0
    for j in range(M):
        a += (Blist[j] * Alist[j])
    if a + C > 0:
        count += 1
print(count)

Solution (Python):
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
for i in range(n):
    x = 0 + c
    for j in range(m):
        x += b[j] * a[i][j]
    if x > 0:
        cnt += 1

print(cnt)

Solution (Python):
N, M, C = map(int, input().split())
B = [int(i) for i in input().split()]
A = [[int(j) for j in input().split()] for i in range(N)]

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

print(count)

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

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

ans = 0

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

print(ans)

Solution (Python):
import sys

input = sys.stdin.readline
n, m, c = map(int, input().split())
b_list = list(map(int, input().split()))
ans = 0
for _ in range(n):
    a_list = list(map(int, input().split()))
    check = 0
    for i in range(m):
        check += a_list[i] * b_list[i]
    if check + c > 0:
        ans += 1
print(ans)

Solution (Python):
N,M,C = map(int, input().split()) 
B=list(map(int, input().split()))
A=[list(map(int, input().split())) for _ in range(N)]
d = []
for a in A:
    c = 0
    for i in range(M):
        c += a[i]*B[i]
    d.append(c+C)
print(sum(x>0 for x in d))