{"problem":{"name":"Can you solve this?","description":{"content":"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","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc121_b"},"statements":[{"statement_type":"Markdown","content":"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}$.\nAdditionally, you are given integers $B_1, B_2, ..., B_M$ and $C$.\nThe $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$.\nAmong the $N$ codes, find the number of codes that correctly solve this problem.\n\n## Constraints\n\n*   All values in input are integers.\n*   $1 \\leq N, M \\leq 20$\n*   $-100 \\leq A_{ij} \\leq 100$\n*   $-100 \\leq B_i \\leq 100$\n*   $-100 \\leq C \\leq 100$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $M$ $C$\n$B_1$ $B_2$ $...$ $B_M$\n$A_{11}$ $A_{12}$ $...$ $A_{1M}$\n$A_{21}$ $A_{22}$ $...$ $A_{2M}$\n$\\vdots$\n$A_{N1}$ $A_{N2}$ $...$ $A_{NM}$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc121_b","tags":[],"sample_group":[["2 3 -10\n1 2 3\n3 2 1\n1 2 2","1\n\nOnly the second code correctly solves this problem, as follows:\n\n*   Since $3 \\times 1 + 2 \\times 2 + 1 \\times 3 + (-10) = 0 \\leq 0$, the first code does not solve this problem.\n*   $1 \\times 1 + 2 \\times 2 + 2 \\times 3 + (-10) = 1 > 0$, the second code solves this problem."],["5 2 -4\n-2 5\n100 41\n100 40\n-3 0\n-6 -2\n18 -13","2"],["3 3 0\n100 -100 0\n0 100 100\n100 100 100\n-100 100 100","0\n\nAll of them are _Wrong Answer_. Except yours."]],"created_at":"2026-03-03 11:01:14"}}