#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;

const int mod = 1e9+7;
bool cmp(int a,int b)
{
    return a>b;
}
class BearCavalry{
public:
    int countAssignments(vector <int> warriors, vector <int> horses)
    {
        sort(warriors.begin()+1,warriors.end(),cmp);
        sort(horses.begin(),horses.end());
        long long ans = 0;
        for(int i=0;i<horses.size();i++)
        {
            sort(horses.begin(),horses.end());
            int p = warriors[0]*horses[i];
            int k = horses[i];
            horses.erase(horses.begin()+i);
            long long ans2 = 1;
            int flag = 0;
            for(int j=1;j<warriors.size();j++)
            {
                long long tmp = -1;
                for(int t=0;t<horses.size();t++)
                {
                    if(warriors[j]*horses[t]>=p)
                        break;
                    tmp = t;
                }
                //cout<<i<<" "<<j<<" "<<tmp<<endl;
                tmp = tmp + 2 - j;
                //cout<<i<<" "<<j<<" "<<tmp<<endl;
                if(tmp<=0)
                {
                    flag = 1;
                    break;
                }
                ans2 = (ans2 * tmp) % mod;
            }
            if(flag==0)
                ans = (ans + ans2) % mod;
            horses.push_back(k);
        }
        return ans;
    }
};

int main()
{
    BearCavalry C;
    vector<int> a;
    vector<int> b;
    a.push_back(5);a.push_back(8);a.push_back(4);a.push_back(8);
    b.push_back(19);b.push_back(40);b.push_back(25);b.push_back(20);
    printf("%d\n",C.countAssignments(a,b));
}