#include <iostream>
#include <algorithm>

using namespace std;
const int N = 20005;
int f[N];
struct Node
{
    int s, v, w;
} a[N];

int main()
{
    int n, m;
    cin >> n >> m;
    int v, w;
    for (int i = 0; i <= m; i++)
    {
        int l, h, v, w;
        if (i != 0)
        {
            cin >> l >> h >> v >> w;
            int s = l / h;
            while (s--)
            {
                for (int j = n; j >= v; j--)
                    f[j] = max(f[j], f[j - v] + w);
            }
        }
        else
        {
            cin >> v >> w;
            int s = n / v;
            while (s--)
            {
                for (int j = n; j >= v; j--)
                    f[j] = max(f[j], f[j - v] + w);
            }
        }
    }
    cout << f[n] << "\n";
}

#include <iostream>

using namespace std;
const int N = 505;
int a[N][N],f[N][N];


int main()
{
    int n;
    scanf("%d",&n);
    for(int i = 1;i <= n; i ++)
        for(int j = 1;j <= i;j ++)
            scanf("%d",&a[i][j]);
    for(int i = n;i > 0;i --)
        for(int j = i;j > 0;j --)
            f[i][j] = max(f[i + 1][j],f[i + 1][j + 1]) + a[i][j];
    printf("%d",f[1][1]);
}

class Solution {
    public List<Integer> getLeastNumbers_Solution(int[] input, int k) {
        Queue<Integer> q = new PriorityQueue<>();
        List<Integer> ans = new LinkedList<>();
        for(int i = 0;i < input.length;i ++)
            q.add(input[i]);
        for(int i = 0;i<k;i++)
        {
            ans.add(q.peek());
            q.remove();
        }
        return ans;   
    }
}

class Solution {
    public int[] findNumbersWithSum(int[] nums, int target) {
        int[] ans = new int[2];
        for(int i = 0;i < nums.length - 1;i++)
        {
            for(int j = i + 1;j < nums.length;j++)
            {
                if(nums[i] + nums[j] == target)
                {
                    ans[0] = nums[i];
                    ans[1] = nums[j];
                    return ans;
                }
            }
        }
        return ans;
    }
}

import java.util.LinkedList;
import java.util.Scanner;
import java.util.Queue;

public class Main
{
    public static void main(String[] args)
    {
        Scanner in = new Scanner(System.in);
        Queue<Integer> q = new LinkedList<>();
        int t = in.nextInt();
        while(true)
        {
            if(t <= 0) break;
            t--;
            String str = in.next();
            if(str.equals("push")){
                int temp = in.nextInt();
                q.add(temp);
            }
            if(str.equals("pop")) q.remove();
            if(str.equals("empty"))
            {
                if(q.isEmpty()) System.out.println("YES");
                else System.out.println("NO");
            }
            if(str.equals("query"))
            {
                System.out.println(q.peek());
            }
        }
    }
}

import java.util.Scanner;
import java.util.Stack;

public class Main
{
    public static void main(String[] args)
    {
        Scanner in = new Scanner(System.in);
        Stack<Integer> s = new Stack<>();
        int t = in.nextInt();
        while(true)
        {
            if(t <= 0) break;
            t--;
            String str = in.next();
            if(str.equals("push")){
                int temp = in.nextInt();
                s.push(temp);
            }
            if(str.equals("pop")) s.pop();
            if(str.equals("empty"))
            {
                if(s.empty()) System.out.println("YES");
                else System.out.println("NO");
            }
            if(str.equals("query"))
            {
                System.out.println(s.peek());
            }
        }
    }
}

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public void deleteNode(ListNode node) {
        ListNode p = node.next;
        node.val = p.val;
        node.next = p.next;
    }
}

import java.io.BufferedWriter;
import java.io.OutputStreamWriter;
import java.util.Scanner;

public class Main
{
    public static int vis[] = new int[10];
    public static int a[] = new int[10];
    public static int n;
    public static BufferedWriter qw = new BufferedWriter(new OutputStreamWriter(System.out));

    public static void dfs(int step) throws Exception
    {
        if(step == n)
        {
            for(int i = 0;i < n;i++)
            {
                qw.write(a[i] + " ");
            }
            qw.write("\n");
            return ;
        }
        for(int i = 1;i <= n; i ++)
        {
            if(vis[i] != 1) {
                vis[i] = 1;
                a[step] = i;
                dfs(step + 1);
                vis[i] = 0;
            }
        }
    }

    public static void main(String[] args) throws Exception
    {
        Scanner in = new Scanner(System.in);
        n = in.nextInt();
        dfs(0);
        qw.flush();
    }
}