using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;
using System.Runtime.Intrinsics.Arm;

class Program
{
    static int NN => int.Parse(ReadLine());
    static long[] NList => ReadLine().Split().Select(long.Parse).ToArray();
    static long[] LList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => long.Parse(ReadLine())).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, m, k) = (c[0], c[1], c[2]);
        var b = ReadLine().Split();
        var a = LList(n);
        Array.Sort(a);
        var ans = 0L;
        for (var i = 0; i < m; ++i)
        {
            var bi = long.Parse(b[i + 1]);
            if (b[0] == "+")
            {
                if (bi + a[0] >= k) ans += n;
                else if (bi + a[^1] >= k)
                {
                    var ng = 0L;
                    var ok = n - 1;
                    while (ok - ng > 1)
                    {
                        var mid = (ok + ng) / 2;
                        if (bi + a[mid] >= k) ok = mid;
                        else ng = mid;
                    }
                    ans += n - ok;
                }
            }
            else
            {
                if (bi * a[0] >= k) ans += n;
                else if (bi * a[^1] >= k)
                {
                    var ng = 0L;
                    var ok = n - 1;
                    while (ok - ng > 1)
                    {
                        var mid = (ok + ng) / 2;
                        if (bi * a[mid] >= k) ok = mid;
                        else ng = mid;
                    }
                    ans += n - ok;
                }
            }
        }
        WriteLine(ans);
    }
}