using System; using static System.Console; using System.Linq; using System.Collections.Generic; class Program { static int NN => int.Parse(ReadLine()); static int[] NList => ReadLine().Split().Select(int.Parse).ToArray(); static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray(); public static void Main() { Solve(); } static void Solve() { var c = NList; var (n, m) = (c[0], c[1]); var map = NArr(n); var a = NList; WriteLine(AinS(n, m, map, a)); } static string AinS(int n, int m, int[][] map, int[] a) { var alist = new List<(int id, int ai)>(a.Length); for (var i = 0; i < a.Length; ++i) alist.Add((i, a[i])); alist.Sort((l, r) => l.ai.CompareTo(r.ai)); var border = 317; var tbl = new List<(int id, int flg, int time, int y)>[border]; for (var i = 0; i < tbl.Length; ++i) tbl[i] = new List<(int id, int flg, int time, int y)>(); var exists = new bool[100001]; foreach (var ai in a) exists[ai] = true; var ans = new int[100001]; for (var i = 0; i < map.Length; ++i) { if (map[i][2] < tbl.Length) { tbl[map[i][2]].Add((i, 1, map[i][0], map[i][3])); tbl[map[i][2]].Add((i, -1, map[i][1] + 1, map[i][3])); } else { for (var j = map[i][3]; j <= 100000; j += map[i][2]) { if (map[i][0] <= j && j <= map[i][1]) { ++ans[j]; } } } } for (var i = 1; i < tbl.Length; ++i) { if (tbl[i].Count == 0) continue; tbl[i].Sort((l, r) => l.time.CompareTo(r.time)); var count = new int[i]; var pos = 0; for (var j = 0; j < alist.Count; ++j) { while (pos < tbl[i].Count && tbl[i][pos].time <= alist[j].ai) { count[tbl[i][pos].y] += tbl[i][pos].flg; ++pos; } ans[alist[j].ai] += count[alist[j].ai % i]; } } return string.Join("\n", a.Select(ai => ans[ai])); } }