The only difference between easy and hard versions is a number of elements in the array.

You are given an array $a$ consisting of $n$ integers. The value of the $i$-th element of the array is $a_i$.

You are also given a set of $m$ segments. The $j$-th segment is $[l_j; r_j]$, where $1 \le l_j \le r_j \le n$.

You can choose some subset of the given set of segments and decrease values on each of the chosen segments by one (independently). For example, if the initial array $a = [0, 0, 0, 0, 0]$ and the given segments are $[1; 3]$ and $[2; 4]$ then you can choose both of them and the array will become $b = [-1, -2, -2, -1, 0]$.

You have to choose some subset of the given segments (each segment can be chosen at most once) in such a way that if you apply this subset of segments to the array $a$ and obtain the array $b$ then the value $\max\limits_{i=1}^{n}b_i - \min\limits_{i=1}^{n}b_i$ will be maximum possible.

Note that you can choose the empty set.

If there are multiple answers, you can print any.

If you are Python programmer, consider using PyPy instead of Python when you submit your code.


-----Input-----

The first line of the input contains two integers $n$ and $m$ ($1 \le n \le 10^5, 0 \le m \le 300$) — the length of the array $a$ and the number of segments, respectively.

The second line of the input contains $n$ integers $a_1, a_2, \dots, a_n$ ($-10^6 \le a_i \le 10^6$), where $a_i$ is the value of the $i$-th element of the array $a$.

The next $m$ lines are contain two integers each. The $j$-th of them contains two integers $l_j$ and $r_j$ ($1 \le l_j \le r_j \le n$), where $l_j$ and $r_j$ are the ends of the $j$-th segment.


-----Output-----

In the first line of the output print one integer $d$ — the maximum possible value $\max\limits_{i=1}^{n}b_i - \min\limits_{i=1}^{n}b_i$ if $b$ is the array obtained by applying some subset of the given segments to the array $a$.

In the second line of the output print one integer $q$ ($0 \le q \le m$) — the number of segments you apply.

In the third line print $q$ distinct integers $c_1, c_2, \dots, c_q$ in any order ($1 \le c_k \le m$) — indices of segments you apply to the array $a$ in such a way that the value $\max\limits_{i=1}^{n}b_i - \min\limits_{i=1}^{n}b_i$ of the obtained array $b$ is maximum possible.

If there are multiple answers, you can print any.


-----Examples-----
Input
5 4
2 -2 3 1 2
1 3
4 5
2 5
1 3

Output
6
2
4 1 

Input
5 4
2 -2 3 1 4
3 5
3 4
2 4
2 5

Output
7
2
3 2 

Input
1 0
1000000

Output
0
0




-----Note-----

In the first example the obtained array $b$ will be $[0, -4, 1, 1, 2]$ so the answer is $6$.

In the second example the obtained array $b$ will be $[2, -3, 1, -1, 4]$ so the answer is $7$.

In the third example you cannot do anything so the answer is $0$.

Difficulty: introductory

Starter code:

Solutions:
import sys

# a very nice implementation of a minimum segment tree with 
# some inspiration taken from https://codeforces.com/blog/entry/18051
# this implementation should be able to be modified to do pretty
# much anything one would want to do with segment trees apart from
# persistance.
# note that especially in python this implementation is much much better
# than most other approches because how slow python can be with function
# calls.

# currently it allows for two operations, both running in o(log n),
# 'add(l,r,value)' adds value to [l,r)
# 'find_min(l,r)' finds the index with the smallest value

class super_seg:
    def __init__(self,data):
        n = len(data)
        m = 1
        while m<n: m *= 2
        
        self.n = n
        self.m = m
        self.data = [0]*(2*m)
        for i in range(n):
            self.data[i+m] = data[i]
        for i in reversed(range(m)):
            self.data[i] = min(self.data[2*i], self.data[2*i+1])
        self.query = [0]*(2*m)
    
    # push the query on seg_ind to its children
    def push(self,seg_ind):
        # let the children know of the queries
        q = self.query[seg_ind]

        self.query[2*seg_ind]   += q
        self.query[2*seg_ind+1] += q
        
        self.data[2*seg_ind]   += q
        self.data[2*seg_ind+1] += q

        # remove queries from seg_ind
        self.data[seg_ind] = min(self.data[2*seg_ind],self.data[2*seg_ind+1])
        self.query[seg_ind] = 0

    # updates the node seg_ind to know of all queries
    # applied to it via its ancestors
    def update(self,seg_ind):
        # find all indecies to be updated
        seg_ind //= 2
        inds = []
        while seg_ind>0:
            inds.append(seg_ind)
            seg_ind//=2
       
        # push the queries down the segment tree
        for ind in reversed(inds):
            self.push(ind)

    # make the changes to seg_ind be known to its ancestors
    def build(self,seg_ind):
        seg_ind//=2
        while seg_ind>0:
            self.data[seg_ind] = min(self.data[2*seg_ind], self.data[2*seg_ind+1]) + self.query[seg_ind]
            seg_ind //= 2

    # lazily add value to [l,r)
    def add(self,l,r,value):
        l += self.m
        r += self.m
        
        l0 = l
        r0 = r

        while l<r:
            if l%2==1:
                self.query[l]+= value
                self.data[l] += value
                l+=1
            if r%2==1:
                r-=1
                self.query[r]+= value
                self.data[r] += value
            l//=2
            r//=2

        # tell all nodes above of the updated
        # area of the updates
        self.build(l0)
        self.build(r0-1)
    
    # min of data[l,r)
    def min(self,l,r):
        l += self.m
        r += self.m

        # apply all the lazily stored queries
        self.update(l)
        self.update(r-1)
        
        segs = []
        while l<r:
            if l%2==1:
                segs.append(l)
                l+=1
            if r%2==1:
                r-=1
                segs.append(r)
            l//=2
            r//=2

        return min(self.data[ind] for ind in segs)


    # find index of smallest value in data[l,r)
    def find_min(self,l,r):
        l += self.m
        r += self.m
        
        # apply all the lazily stored queries
        self.update(l)
        self.update(r-1)

        segs = []
        while l<r:
            if l%2==1:
                segs.append(l)
                l+=1
            if r%2==1:
                r-=1
                segs.append(r)
            l//=2
            r//=2

        ind = min(segs, key=lambda i:self.data[i])
        mini = self.data[ind]
       
        # dig down in search of mini
        while ind<self.m:
            self.push(ind)

            if self.data[2*ind]==mini:
                ind *= 2
            else:
                ind = 2*ind+1
        
        return ind-self.m,mini


n,m = [int(x) for x in input().split()]

A = [int(x) for x in input().split()]

inter = []
inter2 = []
for _ in range(m):
    l,r = [int(x) for x in input().split()]
    l -= 1
    inter.append((l,r))
    inter2.append((r,l))

inter_copy = inter[:]

inter.sort()
inter2.sort()

Aneg = super_seg([-a for a in A])

besta = -1
besta_ind = -1

j1 = 0
j2 = 0
for i in range(n):
    # Only segments containing i should be active
    # Activate
    while j1<m and inter[j1][0]<=i:
        l,r = inter[j1]
        Aneg.add(l,r,1)
        j1 += 1
    # Deactivate
    while j2<m and inter2[j2][0]<=i:
        r,l = inter2[j2]
        Aneg.add(l,r,-1)
        j2 += 1
    Amax = -Aneg.min(0,n)
    Ai = -Aneg.min(i,i+1)
    if Amax-Ai>besta:
        besta = Amax-Ai
        besta_ind = i

ints = [j for j in range(m) if inter_copy[j][0]<=besta_ind<inter_copy[j][1]]

print(besta)
print(len(ints))
print(*[x+1 for x in ints])

import sys

# a very nice implementation of a minimum segment tree with 
# some inspiration taken from https://codeforces.com/blog/entry/18051
# this implementation should be able to be modified to do pretty
# much anything one would want to do with segment trees apart from
# persistance.
# note that especially in python this implementation is much much better
# than most other approches because how slow python can be with function
# calls.

# currently it allows for two operations, both running in o(log n),
# 'add(l,r,value)' adds value to [l,r)
# 'find_min(l,r)' finds the index with the smallest value

big = 10**9

class super_seg:
    def __init__(self,data):
        n = len(data)
        m = 1
        while m<n: m *= 2
        
        self.n = n
        self.m = m
        self.data = [big]*(2*m)
        for i in range(n):
            self.data[i+m] = data[i]
        for i in reversed(list(range(m))):
            self.data[i] = min(self.data[2*i], self.data[2*i+1])
        self.query = [0]*(2*m)
    
    # push the query on seg_ind to its children
    def push(self,seg_ind):
        # let the children know of the queries
        q = self.query[seg_ind]

        self.query[2*seg_ind]   += q
        self.query[2*seg_ind+1] += q
        
        self.data[2*seg_ind]   += q
        self.data[2*seg_ind+1] += q

        # remove queries from seg_ind
        self.data[seg_ind] = min(self.data[2*seg_ind],self.data[2*seg_ind+1])
        self.query[seg_ind] = 0

    # updates the node seg_ind to know of all queries
    # applied to it via its ancestors
    def update(self,seg_ind):
        # find all indecies to be updated
        seg_ind //= 2
        inds = []
        while seg_ind>0:
            inds.append(seg_ind)
            seg_ind//=2
       
        # push the queries down the segment tree
        for ind in reversed(inds):
            self.push(ind)

    # make the changes to seg_ind be known to its ancestors
    def build(self,seg_ind):
        seg_ind//=2
        while seg_ind>0:
            self.data[seg_ind] = min(self.data[2*seg_ind], self.data[2*seg_ind+1]) + self.query[seg_ind]
            seg_ind //= 2

    # lazily add value to [l,r)
    def add(self,l,r,value):
        l += self.m
        r += self.m
        
        l0 = l
        r0 = r

        while l<r:
            if l%2==1:
                self.query[l]+= value
                self.data[l] += value
                l+=1
            if r%2==1:
                r-=1
                self.query[r]+= value
                self.data[r] += value
            l//=2
            r//=2

        # tell all nodes above of the updated
        # area of the updates
        self.build(l0)
        self.build(r0-1)
    
    # min of data[l,r)
    def min(self,l,r):
        l += self.m
        r += self.m

        # apply all the lazily stored queries
        self.update(l)
        self.update(r-1)
        
        segs = []
        while l<r:
            if l%2==1:
                segs.append(l)
                l+=1
            if r%2==1:
                r-=1
                segs.append(r)
            l//=2
            r//=2

        return min(self.data[ind] for ind in segs)


    # find index of smallest value in data[l,r)
    def find_min(self,l,r):
        l += self.m
        r += self.m
        
        # apply all the lazily stored queries
        self.update(l)
        self.update(r-1)

        segs = []
        while l<r:
            if l%2==1:
                segs.append(l)
                l+=1
            if r%2==1:
                r-=1
                segs.append(r)
            l//=2
            r//=2

        ind = min(segs, key=lambda i:self.data[i])
        mini = self.data[ind]
       
        # dig down in search of mini
        while ind<self.m:
            self.push(ind)

            if self.data[2*ind]==mini:
                ind *= 2
            else:
                ind = 2*ind+1
        
        return ind-self.m,mini


n,m = [int(x) for x in input().split()]

A = [int(x) for x in input().split()]

inter = []
inter2 = []
for _ in range(m):
    l,r = [int(x) for x in input().split()]
    l -= 1
    inter.append((l,r))
    inter2.append((r,l))

inter_copy = inter[:]

inter.sort()
inter2.sort()

Aneg = super_seg([-a for a in A])

besta = -1
besta_ind = -1

j1 = 0
j2 = 0
for i in range(n):
    # Only segments containing i should be active
    # Activate
    while j1<m and inter[j1][0]<=i:
        l,r = inter[j1]
        Aneg.add(l,r,1)
        j1 += 1
    # Deactivate
    while j2<m and inter2[j2][0]<=i:
        r,l = inter2[j2]
        Aneg.add(l,r,-1)
        j2 += 1
    Amax = -Aneg.data[1]
    Ai = A[i]-(j1-j2)
    if Amax-Ai>besta:
        besta = Amax-Ai
        besta_ind = i

ints = [i for i in range(m) if inter_copy[i][0]<=besta_ind<inter_copy[i][1]]

print(besta)
print(len(ints))
print(*[x+1 for x in ints])


import sys

# a very nice implementation of a minimum segment tree with 
# some inspiration taken from https://codeforces.com/blog/entry/18051
# this implementation should be able to be modified to do pretty
# much anything one would want to do with segment trees apart from
# persistance.
# note that especially in python this implementation is much much better
# than most other approches because how slow python can be with function
# calls.

# currently it allows for two operations, both running in o(log n),
# 'add(l,r,value)' adds value to [l,r)
# 'find_min(l,r)' finds the index with the smallest value

big = 10**9

class super_seg:
    def __init__(self,data):
        n = len(data)
        m = 1
        while m<n: m *= 2
        
        self.n = n
        self.m = m
        self.data = [big]*(2*m)
        for i in range(n):
            self.data[i+m] = data[i]
        for i in reversed(list(range(m))):
            self.data[i] = min(self.data[2*i], self.data[2*i+1])
        self.query = [0]*(2*m)
    
    # push the query on seg_ind to its children
    def push(self,seg_ind):
        # let the children know of the queries
        q = self.query[seg_ind]

        self.query[2*seg_ind]   += q
        self.query[2*seg_ind+1] += q
        
        self.data[2*seg_ind]   += q
        self.data[2*seg_ind+1] += q

        # remove queries from seg_ind
        self.data[seg_ind] = min(self.data[2*seg_ind],self.data[2*seg_ind+1])
        self.query[seg_ind] = 0

    # updates the node seg_ind to know of all queries
    # applied to it via its ancestors
    def update(self,seg_ind):
        # find all indecies to be updated
        seg_ind //= 2
        inds = []
        while seg_ind>0:
            inds.append(seg_ind)
            seg_ind//=2
       
        # push the queries down the segment tree
        for ind in reversed(inds):
            self.push(ind)

    # make the changes to seg_ind be known to its ancestors
    def build(self,seg_ind):
        seg_ind//=2
        while seg_ind>0:
            self.data[seg_ind] = min(self.data[2*seg_ind], self.data[2*seg_ind+1]) + self.query[seg_ind]
            seg_ind //= 2

    # lazily add value to [l,r)
    def add(self,l,r,value):
        l += self.m
        r += self.m
        
        l0 = l
        r0 = r

        while l<r:
            if l%2==1:
                self.query[l]+= value
                self.data[l] += value
                l+=1
            if r%2==1:
                r-=1
                self.query[r]+= value
                self.data[r] += value
            l//=2
            r//=2

        # tell all nodes above of the updated
        # area of the updates
        self.build(l0)
        self.build(r0-1)
    
    # min of data[l,r)
    def min(self,l,r):
        l += self.m
        r += self.m

        # apply all the lazily stored queries
        self.update(l)
        self.update(r-1)
        
        segs = []
        while l<r:
            if l%2==1:
                segs.append(l)
                l+=1
            if r%2==1:
                r-=1
                segs.append(r)
            l//=2
            r//=2

        return min(self.data[ind] for ind in segs)


    # find index of smallest value in data[l,r)
    def find_min(self,l,r):
        l += self.m
        r += self.m
        
        # apply all the lazily stored queries
        self.update(l)
        self.update(r-1)

        segs = []
        while l<r:
            if l%2==1:
                segs.append(l)
                l+=1
            if r%2==1:
                r-=1
                segs.append(r)
            l//=2
            r//=2

        ind = min(segs, key=lambda i:self.data[i])
        mini = self.data[ind]
       
        # dig down in search of mini
        while ind<self.m:
            self.push(ind)

            if self.data[2*ind]==mini:
                ind *= 2
            else:
                ind = 2*ind+1
        
        return ind-self.m,mini


n,m = [int(x) for x in input().split()]

A = [int(x) for x in input().split()]

inter = []
inter2 = []
for _ in range(m):
    l,r = [int(x) for x in input().split()]
    l -= 1
    inter.append((l,r))
    inter2.append((r,l))

inter_copy = inter[:]

inter.sort()
inter2.sort()

Aneg = super_seg([-a for a in A])

besta = -1
besta_ind = -1

j1 = 0
j2 = 0
for i in range(n):
    # Only segments containing i should be active
    # Activate
    while j1<m and inter[j1][0]<=i:
        l,r = inter[j1]
        Aneg.add(l,r,1)
        j1 += 1
    # Deactivate
    while j2<m and inter2[j2][0]<=i:
        r,l = inter2[j2]
        Aneg.add(l,r,-1)
        j2 += 1
    Amax = -Aneg.data[1]
    Ai = A[i]-(j1-j2)
    if Amax-Ai>besta:
        besta = Amax-Ai
        besta_ind = i

ints = [i for i in range(m) if inter_copy[i][0]<=besta_ind<inter_copy[i][1]]

print(besta)
print(len(ints))
print(*[x+1 for x in ints])


import sys

# a very nice implementation of a minimum segment tree with 
# some inspiration taken from https://codeforces.com/blog/entry/18051
# this implementation should be able to be modified to do pretty
# much anything one would want to do with segment trees apart from
# persistance.
# note that especially in python this implementation is much much better
# than most other approches because how slow python can be with function
# calls.

# currently it allows for two operations, both running in o(log n),
# 'add(l,r,value)' adds value to [l,r)
# 'find_min(l,r)' finds the index with the smallest value

big = 10**9

class super_seg:
    def __init__(self,data):
        n = len(data)
        m = 1
        while m<n: m *= 2
        
        self.n = n
        self.m = m
        self.data = [big]*(2*m)
        for i in range(n):
            self.data[i+m] = data[i]
        for i in reversed(range(m)):
            self.data[i] = min(self.data[2*i], self.data[2*i+1])
        self.query = [0]*(2*m)
    
    # push the query on seg_ind to its children
    def push(self,seg_ind):
        # let the children know of the queries
        q = self.query[seg_ind]

        self.query[2*seg_ind]   += q
        self.query[2*seg_ind+1] += q
        
        self.data[2*seg_ind]   += q
        self.data[2*seg_ind+1] += q

        # remove queries from seg_ind
        self.data[seg_ind] = min(self.data[2*seg_ind],self.data[2*seg_ind+1])
        self.query[seg_ind] = 0

    # updates the node seg_ind to know of all queries
    # applied to it via its ancestors
    def update(self,seg_ind):
        # find all indecies to be updated
        seg_ind //= 2
        inds = []
        while seg_ind>0:
            inds.append(seg_ind)
            seg_ind//=2
       
        # push the queries down the segment tree
        for ind in reversed(inds):
            self.push(ind)

    # make the changes to seg_ind be known to its ancestors
    def build(self,seg_ind):
        seg_ind//=2
        while seg_ind>0:
            self.data[seg_ind] = min(self.data[2*seg_ind], self.data[2*seg_ind+1]) + self.query[seg_ind]
            seg_ind //= 2

    # lazily add value to [l,r)
    def add(self,l,r,value):
        l += self.m
        r += self.m
        
        l0 = l
        r0 = r

        while l<r:
            if l%2==1:
                self.query[l]+= value
                self.data[l] += value
                l+=1
            if r%2==1:
                r-=1
                self.query[r]+= value
                self.data[r] += value
            l//=2
            r//=2

        # tell all nodes above of the updated
        # area of the updates
        self.build(l0)
        self.build(r0-1)
    
    # min of data[l,r)
    def min(self,l,r):
        l += self.m
        r += self.m

        # apply all the lazily stored queries
        self.update(l)
        self.update(r-1)
        
        segs = []
        while l<r:
            if l%2==1:
                segs.append(l)
                l+=1
            if r%2==1:
                r-=1
                segs.append(r)
            l//=2
            r//=2

        return min(self.data[ind] for ind in segs)


    # find index of smallest value in data[l,r)
    def find_min(self,l,r):
        l += self.m
        r += self.m
        
        # apply all the lazily stored queries
        self.update(l)
        self.update(r-1)

        segs = []
        while l<r:
            if l%2==1:
                segs.append(l)
                l+=1
            if r%2==1:
                r-=1
                segs.append(r)
            l//=2
            r//=2

        ind = min(segs, key=lambda i:self.data[i])
        mini = self.data[ind]
       
        # dig down in search of mini
        while ind<self.m:
            self.push(ind)

            if self.data[2*ind]==mini:
                ind *= 2
            else:
                ind = 2*ind+1
        
        return ind-self.m,mini


n,m = [int(x) for x in input().split()]

A = [int(x) for x in input().split()]

inter = []
inter2 = []
for _ in range(m):
    l,r = [int(x) for x in input().split()]
    l -= 1
    inter.append((l,r))
    inter2.append((r,l))

inter_copy = inter[:]

inter.sort()
inter2.sort()

Aneg = super_seg([-a for a in A])

besta = -1
besta_ind = -1

j1 = 0
j2 = 0
for i in range(n):
    # Only segments containing i should be active
    # Activate
    while j1<m and inter[j1][0]<=i:
        l,r = inter[j1]
        Aneg.add(l,r,1)
        j1 += 1
    # Deactivate
    while j2<m and inter2[j2][0]<=i:
        r,l = inter2[j2]
        Aneg.add(l,r,-1)
        j2 += 1
    Amax = -Aneg.data[1]
    Ai = A[i]-(j1-j2)
    if Amax-Ai>besta:
        besta = Amax-Ai
        besta_ind = i

ints = [i for i in range(m) if inter_copy[i][0]<=besta_ind<inter_copy[i][1]]

print(besta)
print(len(ints))
print(*[x+1 for x in ints])

import sys

# a very nice implementation of a minimum segment tree with 
# some inspiration taken from https://codeforces.com/blog/entry/18051
# this implementation should be able to be modified to do pretty
# much anything one would want to do with segment trees apart from
# persistance.
# note that especially in python this implementation is much much better
# than most other approches because how slow python can be with function
# calls. /pajenegod

# currently it allows for two operations, both running in o(log n),
# 'add(l,r,value)' adds value to [l,r)
# 'find_min(l,r)' finds the index with the smallest value

big = 10**9

class super_seg:
    def __init__(self,data):
        n = len(data)
        m = 1
        while m<n: m *= 2
        
        self.n = n
        self.m = m
        self.data = [big]*(2*m)
        for i in range(n):
            self.data[i+m] = data[i]
        for i in reversed(range(m)):
            self.data[i] = min(self.data[2*i], self.data[2*i+1])
        self.query = [0]*(2*m)
    
    # push the query on seg_ind to its children
    def push(self,seg_ind):
        # let the children know of the queries
        q = self.query[seg_ind]

        self.query[2*seg_ind]   += q
        self.query[2*seg_ind+1] += q
        
        self.data[2*seg_ind]   += q
        self.data[2*seg_ind+1] += q

        # remove queries from seg_ind
        self.data[seg_ind] = min(self.data[2*seg_ind],self.data[2*seg_ind+1])
        self.query[seg_ind] = 0

    # updates the node seg_ind to know of all queries
    # applied to it via its ancestors
    def update(self,seg_ind):
        # find all indecies to be updated
        seg_ind //= 2
        inds = []
        while seg_ind>0:
            inds.append(seg_ind)
            seg_ind//=2
       
        # push the queries down the segment tree
        for ind in reversed(inds):
            self.push(ind)

    # make the changes to seg_ind be known to its ancestors
    def build(self,seg_ind):
        seg_ind//=2
        while seg_ind>0:
            self.data[seg_ind] = min(self.data[2*seg_ind], self.data[2*seg_ind+1]) + self.query[seg_ind]
            seg_ind //= 2

    # lazily add value to [l,r)
    def add(self,l,r,value):
        l += self.m
        r += self.m
        
        l0 = l
        r0 = r

        while l<r:
            if l%2==1:
                self.query[l]+= value
                self.data[l] += value
                l+=1
            if r%2==1:
                r-=1
                self.query[r]+= value
                self.data[r] += value
            l//=2
            r//=2

        # tell all nodes above of the updated
        # area of the updates
        self.build(l0)
        self.build(r0-1)
    
    # min of data[l,r)
    def min(self,l,r):
        l += self.m
        r += self.m

        # apply all the lazily stored queries
        self.update(l)
        self.update(r-1)
        
        segs = []
        while l<r:
            if l%2==1:
                segs.append(l)
                l+=1
            if r%2==1:
                r-=1
                segs.append(r)
            l//=2
            r//=2

        return min(self.data[ind] for ind in segs)


    # find index of smallest value in data[l,r)
    def find_min(self,l,r):
        l += self.m
        r += self.m
        
        # apply all the lazily stored queries
        self.update(l)
        self.update(r-1)

        segs = []
        while l<r:
            if l%2==1:
                segs.append(l)
                l+=1
            if r%2==1:
                r-=1
                segs.append(r)
            l//=2
            r//=2

        ind = min(segs, key=lambda i:self.data[i])
        mini = self.data[ind]
       
        # dig down in search of mini
        while ind<self.m:
            self.push(ind)

            if self.data[2*ind]==mini:
                ind *= 2
            else:
                ind = 2*ind+1
        
        return ind-self.m,mini


n,m = [int(x) for x in input().split()]

A = [int(x) for x in input().split()]

inter = []
bucketsl = [[] for _ in range(n)]
bucketsr = [[] for _ in range(n)]
for _ in range(m):
    l,r = [int(x) for x in input().split()]
    l -= 1
    inter.append((l,r))
    bucketsl[l].append(r)
    if r<n:
        bucketsr[r].append(l)

Aneg = super_seg([-a for a in A])

besta = -1
besta_ind = -1

active_intervals = 0
for i in range(n):
    # Activate
    for r in bucketsl[i]:
        Aneg.add(i,r,1)
        active_intervals += 1
    # Deactivate
    for l in bucketsr[i]:
        Aneg.add(l,i,-1)
        active_intervals -= 1
    Amax = -Aneg.data[1]
    Ai = A[i] - active_intervals
    if Amax-Ai>besta:
        besta = Amax-Ai
        besta_ind = i

ints = [i for i in range(m) if inter[i][0]<=besta_ind<inter[i][1]]

print(besta)
print(len(ints))
print(*[x+1 for x in ints])

import sys

# a very nice implementation of a minimum segment tree with 
# some inspiration taken from https://codeforces.com/blog/entry/18051
# this implementation should be able to be modified to do pretty
# much anything one would want to do with segment trees apart from
# persistance.
# note that especially in python this implementation is much much better
# than most other approches because how slow python can be with function
# calls. /pajenegod

# currently it allows for two operations, both running in o(log n),
# 'add(l,r,value)' adds value to [l,r)
# 'find_min(l,r)' finds the index with the smallest value

big = 10**9

class super_seg:
    def __init__(self,data):
        n = len(data)
        m = 1
        while m<n: m *= 2
        
        self.n = n
        self.m = m
        self.data = [big]*(2*m)
        for i in range(n):
            self.data[i+m] = data[i]
        for i in reversed(range(m)):
            self.data[i] = min(self.data[2*i], self.data[2*i+1])
        self.query = [0]*(2*m)
    
    # push the query on seg_ind to its children
    def push(self,seg_ind):
        # let the children know of the queries
        q = self.query[seg_ind]

        self.query[2*seg_ind]   += q
        self.query[2*seg_ind+1] += q
        
        self.data[2*seg_ind]   += q
        self.data[2*seg_ind+1] += q

        # remove queries from seg_ind
        self.data[seg_ind] = min(self.data[2*seg_ind],self.data[2*seg_ind+1])
        self.query[seg_ind] = 0

    # updates the node seg_ind to know of all queries
    # applied to it via its ancestors
    def update(self,seg_ind):
        # find all indecies to be updated
        seg_ind //= 2
        inds = []
        while seg_ind>0:
            inds.append(seg_ind)
            seg_ind//=2
       
        # push the queries down the segment tree
        for ind in reversed(inds):
            self.push(ind)

    # make the changes to seg_ind be known to its ancestors
    def build(self,seg_ind):
        seg_ind//=2
        while seg_ind>0:
            self.data[seg_ind] = min(self.data[2*seg_ind], self.data[2*seg_ind+1]) + self.query[seg_ind]
            seg_ind //= 2

    # lazily add value to [l,r)
    def add(self,l,r,value):
        l += self.m
        r += self.m
        
        l0 = l
        r0 = r

        while l<r:
            if l%2==1:
                self.query[l]+= value
                self.data[l] += value
                l+=1
            if r%2==1:
                r-=1
                self.query[r]+= value
                self.data[r] += value
            l//=2
            r//=2

        # tell all nodes above of the updated
        # area of the updates
        self.build(l0)
        self.build(r0-1)
    
    # min of data[l,r)
    def min(self,l,r):
        l += self.m
        r += self.m

        # apply all the lazily stored queries
        self.update(l)
        self.update(r-1)
        
        segs = []
        while l<r:
            if l%2==1:
                segs.append(l)
                l+=1
            if r%2==1:
                r-=1
                segs.append(r)
            l//=2
            r//=2

        return min(self.data[ind] for ind in segs)


    # find index of smallest value in data[l,r)
    def find_min(self,l,r):
        l += self.m
        r += self.m
        
        # apply all the lazily stored queries
        self.update(l)
        self.update(r-1)

        segs = []
        while l<r:
            if l%2==1:
                segs.append(l)
                l+=1
            if r%2==1:
                r-=1
                segs.append(r)
            l//=2
            r//=2

        ind = min(segs, key=lambda i:self.data[i])
        mini = self.data[ind]
       
        # dig down in search of mini
        while ind<self.m:
            self.push(ind)

            if self.data[2*ind]==mini:
                ind *= 2
            else:
                ind = 2*ind+1
        
        return ind-self.m,mini


n,m = [int(x) for x in input().split()]

A = [int(x) for x in input().split()]

inter = []
bucketsl = [[] for _ in range(n)]
bucketsr = [[] for _ in range(n)]
for _ in range(m):
    l,r = [int(x) for x in input().split()]
    l -= 1
    inter.append((l,r))
    bucketsl[l].append(r)
    if r<n:
        bucketsr[r].append(l)

Aneg = super_seg([-a for a in A])

besta = -1
besta_ind = -1

active_intervals = 0
for i in range(n):
    # Activate
    for r in bucketsl[i]:
        Aneg.add(i,r,1)
        active_intervals += 1
    # Deactivate
    for l in bucketsr[i]:
        Aneg.add(l,i,-1)
        active_intervals -= 1
    Amax = -Aneg.data[1]
    Ai = A[i] - active_intervals
    if Amax-Ai>besta:
        besta = Amax-Ai
        besta_ind = i

ints = [i for i in range(m) if inter[i][0]<=besta_ind<inter[i][1]]

print(besta)
print(len(ints))
print(*[x+1 for x in ints])

import sys

# a very nice implementation of a minimum segment tree with 
# some inspiration taken from https://codeforces.com/blog/entry/18051
# this implementation should be able to be modified to do pretty
# much anything one would want to do with segment trees apart from
# persistance.
# note that especially in python this implementation is much much better
# than most other approches because how slow python can be with function
# calls. /pajenegod

# currently it allows for two operations, both running in o(log n),
# 'add(l,r,value)' adds value to [l,r)
# 'find_min(l,r)' finds the index with the smallest value

big = 10**9

class super_seg:
    def __init__(self,data):
        n = len(data)
        m = 1
        while m<n: m *= 2
        
        self.n = n
        self.m = m
        self.data = [big]*(2*m)
        for i in range(n):
            self.data[i+m] = data[i]
        for i in reversed(list(range(m))):
            self.data[i] = min(self.data[2*i], self.data[2*i+1])
        self.query = [0]*(2*m)
    
    # push the query on seg_ind to its children
    def push(self,seg_ind):
        # let the children know of the queries
        q = self.query[seg_ind]

        self.query[2*seg_ind]   += q
        self.query[2*seg_ind+1] += q
        
        self.data[2*seg_ind]   += q
        self.data[2*seg_ind+1] += q

        # remove queries from seg_ind
        self.data[seg_ind] = min(self.data[2*seg_ind],self.data[2*seg_ind+1])
        self.query[seg_ind] = 0

    # updates the node seg_ind to know of all queries
    # applied to it via its ancestors
    def update(self,seg_ind):
        # find all indecies to be updated
        seg_ind //= 2
        inds = []
        while seg_ind>0:
            inds.append(seg_ind)
            seg_ind//=2
       
        # push the queries down the segment tree
        for ind in reversed(inds):
            self.push(ind)

    # make the changes to seg_ind be known to its ancestors
    def build(self,seg_ind):
        seg_ind//=2
        while seg_ind>0:
            self.data[seg_ind] = min(self.data[2*seg_ind], self.data[2*seg_ind+1]) + self.query[seg_ind]
            seg_ind //= 2

    # lazily add value to [l,r)
    def add(self,l,r,value):
        l += self.m
        r += self.m
        
        l0 = l
        r0 = r

        while l<r:
            if l%2==1:
                self.query[l]+= value
                self.data[l] += value
                l+=1
            if r%2==1:
                r-=1
                self.query[r]+= value
                self.data[r] += value
            l//=2
            r//=2

        # tell all nodes above of the updated
        # area of the updates
        self.build(l0)
        self.build(r0-1)
    
    # min of data[l,r)
    def min(self,l,r):
        l += self.m
        r += self.m

        # apply all the lazily stored queries
        self.update(l)
        self.update(r-1)
        
        segs = []
        while l<r:
            if l%2==1:
                segs.append(l)
                l+=1
            if r%2==1:
                r-=1
                segs.append(r)
            l//=2
            r//=2

        return min(self.data[ind] for ind in segs)


    # find index of smallest value in data[l,r)
    def find_min(self,l,r):
        l += self.m
        r += self.m
        
        # apply all the lazily stored queries
        self.update(l)
        self.update(r-1)

        segs = []
        while l<r:
            if l%2==1:
                segs.append(l)
                l+=1
            if r%2==1:
                r-=1
                segs.append(r)
            l//=2
            r//=2

        ind = min(segs, key=lambda i:self.data[i])
        mini = self.data[ind]
       
        # dig down in search of mini
        while ind<self.m:
            self.push(ind)

            if self.data[2*ind]==mini:
                ind *= 2
            else:
                ind = 2*ind+1
        
        return ind-self.m,mini


n,m = [int(x) for x in input().split()]

A = [int(x) for x in input().split()]

inter = []
update = [[] for _ in range(n+1)]
for _ in range(m):
    l,r = [int(x) for x in input().split()]
    l -= 1
    inter.append((l,r))
    update[l].append((l,r))
    update[r].append((l,r))

Aneg = super_seg([-a for a in A])

besta = -1
besta_ind = -1

active_intervals = 0
for i in range(n):
    for l,r in update[i]:
        Aneg.add(l,r,1 if l==i else -1)
        active_intervals += 1 if l==i else -1 
    Amax = -Aneg.data[1]
    Ai = A[i] - active_intervals
    if Amax-Ai>besta:
        besta = Amax-Ai
        besta_ind = i

ints = [i for i in range(m) if inter[i][0]<=besta_ind<inter[i][1]]
print(besta)
print(len(ints))
print(*[x+1 for x in ints])


import sys

# a very nice implementation of a minimum segment tree with 
# some inspiration taken from https://codeforces.com/blog/entry/18051
# this implementation should be able to be modified to do pretty
# much anything one would want to do with segment trees apart from
# persistance.
# note that especially in python this implementation is much much better
# than most other approches because how slow python can be with function
# calls. /pajenegod

# currently it allows for two operations, both running in o(log n),
# 'add(l,r,value)' adds value to [l,r)
# 'find_min(l,r)' finds the index with the smallest value

big = 10**9

class super_seg:
    def __init__(self,data):
        n = len(data)
        m = 1
        while m<n: m *= 2
        
        self.n = n
        self.m = m
        self.data = [big]*(2*m)
        for i in range(n):
            self.data[i+m] = data[i]
        for i in reversed(list(range(m))):
            self.data[i] = min(self.data[2*i], self.data[2*i+1])
        self.query = [0]*(2*m)
    
    # push the query on seg_ind to its children
    def push(self,seg_ind):
        # let the children know of the queries
        q = self.query[seg_ind]

        self.query[2*seg_ind]   += q
        self.query[2*seg_ind+1] += q
        
        self.data[2*seg_ind]   += q
        self.data[2*seg_ind+1] += q

        # remove queries from seg_ind
        self.data[seg_ind] = min(self.data[2*seg_ind],self.data[2*seg_ind+1])
        self.query[seg_ind] = 0

    # updates the node seg_ind to know of all queries
    # applied to it via its ancestors
    def update(self,seg_ind):
        # find all indecies to be updated
        seg_ind //= 2
        inds = []
        while seg_ind>0:
            inds.append(seg_ind)
            seg_ind//=2
       
        # push the queries down the segment tree
        for ind in reversed(inds):
            self.push(ind)

    # make the changes to seg_ind be known to its ancestors
    def build(self,seg_ind):
        seg_ind//=2
        while seg_ind>0:
            self.data[seg_ind] = min(self.data[2*seg_ind], self.data[2*seg_ind+1]) + self.query[seg_ind]
            seg_ind //= 2

    # lazily add value to [l,r)
    def add(self,l,r,value):
        l += self.m
        r += self.m
        
        l0 = l
        r0 = r

        while l<r:
            if l%2==1:
                self.query[l]+= value
                self.data[l] += value
                l+=1
            if r%2==1:
                r-=1
                self.query[r]+= value
                self.data[r] += value
            l//=2
            r//=2

        # tell all nodes above of the updated
        # area of the updates
        self.build(l0)
        self.build(r0-1)
    
    # min of data[l,r)
    def min(self,l,r):
        l += self.m
        r += self.m

        # apply all the lazily stored queries
        self.update(l)
        self.update(r-1)
        
        segs = []
        while l<r:
            if l%2==1:
                segs.append(l)
                l+=1
            if r%2==1:
                r-=1
                segs.append(r)
            l//=2
            r//=2

        return min(self.data[ind] for ind in segs)


    # find index of smallest value in data[l,r)
    def find_min(self,l,r):
        l += self.m
        r += self.m
        
        # apply all the lazily stored queries
        self.update(l)
        self.update(r-1)

        segs = []
        while l<r:
            if l%2==1:
                segs.append(l)
                l+=1
            if r%2==1:
                r-=1
                segs.append(r)
            l//=2
            r//=2

        ind = min(segs, key=lambda i:self.data[i])
        mini = self.data[ind]
       
        # dig down in search of mini
        while ind<self.m:
            self.push(ind)

            if self.data[2*ind]==mini:
                ind *= 2
            else:
                ind = 2*ind+1
        
        return ind-self.m,mini


n,m = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]

inter = []
update = [[] for _ in range(n+1)]
for _ in range(m):
    l,r = [int(x) for x in input().split()]
    l -= 1
    inter.append((l,r))
    update[l].append((l,r))
    update[r].append((l,r))

Aneg = super_seg([-a for a in A])
besta = -1
besta_ind = -1

active_intervals = 0
for i in range(n):
    for l,r in update[i]:
        Aneg.add(l,r,1 if l==i else -1)
        active_intervals += 1 if l==i else -1 
    Amax = -Aneg.data[1]
    Ai = A[i] - active_intervals
    if Amax-Ai>besta:
        besta = Amax-Ai
        besta_ind = i

ints = [i for i in range(m) if inter[i][0]<=besta_ind<inter[i][1]]
print(besta)
print(len(ints))
print(*[x+1 for x in ints])


import sys
import copy
input = sys.stdin.readline

n,m=map(int,input().split())
A=list(map(int,input().split()))

LR=[list(map(int,input().split())) for i in range(m)]


MLIST=[]
for l,r in LR:
    MLIST.append(l)
    MLIST.append(r)

MLIST=list(set(MLIST))
MLIST.sort()
MLIST.append(10**9)


MDICT=dict()
MLEN=len(MLIST)
for i in range(MLEN):
    MDICT[MLIST[i]]=i


MINUSLIST=[[0]*(MLEN*2-1) for i in range(MLEN)]

for l,r in LR:
    for j in range(MDICT[l],MDICT[r]+1):
        for k in range(MDICT[l]*2+1,MDICT[r]*2+2):
            MINUSLIST[j][k]+=1
            
#print(MLIST)
#print(MINUSLIST)


A_m=[[float("inf"),-float("inf")] for i in range(MLEN*2-1)]

if MLIST[0]!=1:
    A_m[0]=[min(A[:MLIST[0]-1]),max(A[:MLIST[0]-1])]
#if MLIST[MLEN-2]!=n:
#    A_m[MLEN*2-2]=[min(A[MLIST[MLEN-2]:]),max(A[MLIST[MLEN-2]:])]

for i in range(MLEN-1):
    x=MLIST[i]-1
    y=MLIST[i+1]-1

    A_m[2*i+1]=[A[x],A[x]]
    if x+1!=y and x!=n-1:
        A_m[2*i+2]=[min(A[x+1:y]),max(A[x+1:y])]
    
def MINUS(A,B):
    MIN=float("inf")
    MAX=-float("inf")

    for i in range(MLEN*2-1):
        if MIN>A[i][0]-B[i]:
            MIN=A[i][0]-B[i]
        if MAX<A[i][1]-B[i]:
            MAX=A[i][1]-B[i]

    return MAX-MIN

ANSLIST=[0]*MLEN

for i in range(MLEN):
    ANSLIST[i]=MINUS(A_m,MINUSLIST[i])

print(max(ANSLIST))
target=MLIST[ANSLIST.index(max(ANSLIST))]

AN=[]
for i in range(m):
    z,w=LR[i]
    if z<=target<=w:
        AN.append(i+1)

print(len(AN))
for a in AN:
    print(a,end=" ")



import sys

# a very nice implementation of a minimum segment tree with 
# some inspiration taken from https://codeforces.com/blog/entry/18051
# this implementation should be able to be modified to do pretty
# much anything one would want to do with segment trees apart from
# persistance.
# note that especially in python this implementation is much much better
# than most other approches because how slow python can be with function
# calls. /pajenegod

# currently it allows for two operations, both running in o(log n),
# 'add(l,r,value)' adds value to [l,r)
# 'find_min(l,r)' finds the index with the smallest value

big = 10**9

class super_seg:
    def __init__(self,data):
        n = len(data)
        m = 1
        while m<n: m *= 2
        
        self.n = n
        self.m = m
        self.data = [big]*(2*m)
        for i in range(n):
            self.data[i+m] = data[i]
        for i in reversed(range(m)):
            self.data[i] = min(self.data[2*i], self.data[2*i+1])
        self.query = [0]*(2*m)
    
    # push the query on seg_ind to its children
    def push(self,seg_ind):
        # let the children know of the queries
        q = self.query[seg_ind]

        self.query[2*seg_ind]   += q
        self.query[2*seg_ind+1] += q
        
        self.data[2*seg_ind]   += q
        self.data[2*seg_ind+1] += q

        # remove queries from seg_ind
        self.data[seg_ind] = min(self.data[2*seg_ind],self.data[2*seg_ind+1])
        self.query[seg_ind] = 0

    # updates the node seg_ind to know of all queries
    # applied to it via its ancestors
    def update(self,seg_ind):
        # find all indecies to be updated
        seg_ind //= 2
        inds = []
        while seg_ind>0:
            inds.append(seg_ind)
            seg_ind//=2
       
        # push the queries down the segment tree
        for ind in reversed(inds):
            self.push(ind)

    # make the changes to seg_ind be known to its ancestors
    def build(self,seg_ind):
        seg_ind//=2
        while seg_ind>0:
            self.data[seg_ind] = min(self.data[2*seg_ind], self.data[2*seg_ind+1]) + self.query[seg_ind]
            seg_ind //= 2

    # lazily add value to [l,r)
    def add(self,l,r,value):
        l += self.m
        r += self.m
        
        l0 = l
        r0 = r

        while l<r:
            if l%2==1:
                self.query[l]+= value
                self.data[l] += value
                l+=1
            if r%2==1:
                r-=1
                self.query[r]+= value
                self.data[r] += value
            l//=2
            r//=2

        # tell all nodes above of the updated
        # area of the updates
        self.build(l0)
        self.build(r0-1)
    
    # min of data[l,r)
    def min(self,l,r):
        l += self.m
        r += self.m

        # apply all the lazily stored queries
        self.update(l)
        self.update(r-1)
        
        segs = []
        while l<r:
            if l%2==1:
                segs.append(l)
                l+=1
            if r%2==1:
                r-=1
                segs.append(r)
            l//=2
            r//=2

        return min(self.data[ind] for ind in segs)


    # find index of smallest value in data[l,r)
    def find_min(self,l,r):
        l += self.m
        r += self.m
        
        # apply all the lazily stored queries
        self.update(l)
        self.update(r-1)

        segs = []
        while l<r:
            if l%2==1:
                segs.append(l)
                l+=1
            if r%2==1:
                r-=1
                segs.append(r)
            l//=2
            r//=2

        ind = min(segs, key=lambda i:self.data[i])
        mini = self.data[ind]
       
        # dig down in search of mini
        while ind<self.m:
            self.push(ind)

            if self.data[2*ind]==mini:
                ind *= 2
            else:
                ind = 2*ind+1
        
        return ind-self.m,mini


n,m = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]

inter = []
update = [[] for _ in range(n+1)]
for _ in range(m):
    l,r = [int(x) for x in input().split()]
    l -= 1
    inter.append((l,r))
    update[l].append((l,r))
    update[r].append((l,r))

Aneg = super_seg([-a for a in A])
besta = -1
besta_ind = -1

active_intervals = 0
for i in range(n):
    for l,r in update[i]:
        Aneg.add(l,r,1 if l==i else -1)
        active_intervals += 1 if l==i else -1 
    Amax = -Aneg.data[1]
    Ai = A[i] - active_intervals
    if Amax-Ai>besta:
        besta = Amax-Ai
        besta_ind = i

ints = [i for i in range(m) if inter[i][0]<=besta_ind<inter[i][1]]
print(besta)
print(len(ints))
print(*[x+1 for x in ints])

import sys

# a very nice implementation of a minimum segment tree with 
# some inspiration taken from https://codeforces.com/blog/entry/18051
# this implementation should be able to be modified to do pretty
# much anything one would want to do with segment trees apart from
# persistance.
# note that especially in python this implementation is much much better
# than most other approches because how slow python can be with function
# calls. /pajenegod

# currently it allows for two operations, both running in o(log n),
# 'add(l,r,value)' adds value to [l,r)
# 'find_min(l,r)' finds the index with the smallest value

big = 10**9

class super_seg:
    def __init__(self,data):
        n = len(data)
        m = 1
        while m<n: m *= 2
        
        self.n = n
        self.m = m
        self.data = [big]*(2*m)
        for i in range(n):
            self.data[i+m] = data[i]
        for i in reversed(range(m)):
            self.data[i] = min(self.data[2*i], self.data[2*i+1])
        self.query = [0]*(2*m)
    
    # push the query on seg_ind to its children
    def push(self,seg_ind):
        # let the children know of the queries
        q = self.query[seg_ind]

        self.query[2*seg_ind]   += q
        self.query[2*seg_ind+1] += q
        
        self.data[2*seg_ind]   += q
        self.data[2*seg_ind+1] += q

        # remove queries from seg_ind
        self.data[seg_ind] = min(self.data[2*seg_ind],self.data[2*seg_ind+1])
        self.query[seg_ind] = 0

    # updates the node seg_ind to know of all queries
    # applied to it via its ancestors
    def update(self,seg_ind):
        # find all indecies to be updated
        seg_ind //= 2
        inds = []
        while seg_ind>0:
            inds.append(seg_ind)
            seg_ind//=2
       
        # push the queries down the segment tree
        for ind in reversed(inds):
            self.push(ind)

    # make the changes to seg_ind be known to its ancestors
    def build(self,seg_ind):
        seg_ind//=2
        while seg_ind>0:
            self.data[seg_ind] = min(self.data[2*seg_ind], self.data[2*seg_ind+1]) + self.query[seg_ind]
            seg_ind //= 2

    # lazily add value to [l,r)
    def add(self,l,r,value):
        l += self.m
        r += self.m
        
        l0 = l
        r0 = r

        while l<r:
            if l%2==1:
                self.query[l]+= value
                self.data[l] += value
                l+=1
            if r%2==1:
                r-=1
                self.query[r]+= value
                self.data[r] += value
            l//=2
            r//=2

        # tell all nodes above of the updated
        # area of the updates
        self.build(l0)
        self.build(r0-1)
    
    # min of data[l,r)
    def min(self,l,r):
        l += self.m
        r += self.m

        # apply all the lazily stored queries
        self.update(l)
        self.update(r-1)
        
        segs = []
        while l<r:
            if l%2==1:
                segs.append(l)
                l+=1
            if r%2==1:
                r-=1
                segs.append(r)
            l//=2
            r//=2

        return min(self.data[ind] for ind in segs)


    # find index of smallest value in data[l,r)
    def find_min(self,l,r):
        l += self.m
        r += self.m
        
        # apply all the lazily stored queries
        self.update(l)
        self.update(r-1)

        segs = []
        while l<r:
            if l%2==1:
                segs.append(l)
                l+=1
            if r%2==1:
                r-=1
                segs.append(r)
            l//=2
            r//=2

        ind = min(segs, key=lambda i:self.data[i])
        mini = self.data[ind]
       
        # dig down in search of mini
        while ind<self.m:
            self.push(ind)

            if self.data[2*ind]==mini:
                ind *= 2
            else:
                ind = 2*ind+1
        
        return ind-self.m,mini


n,m = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]

inter = []
update = [[] for _ in range(n+1)]
for _ in range(m):
    l,r = [int(x) for x in input().split()]
    l -= 1
    inter.append((l,r))
    update[l].append((l,r))
    update[r].append((l,r))

Aneg = super_seg([-a for a in A])
besta = -1
besta_ind = -1

active_intervals = 0
for i in range(n):
    for l,r in update[i]:
        Aneg.add(l,r,1 if l==i else -1)
        active_intervals += 1 if l==i else -1 
    Amax = -Aneg.data[1]
    Ai = A[i] - active_intervals
    if Amax-Ai>besta:
        besta = Amax-Ai
        besta_ind = i

ints = [i for i in range(m) if inter[i][0]<=besta_ind<inter[i][1]]
print(besta)
print(len(ints))
print(*[x+1 for x in ints])

def main():
    n, m = list(map(int, input().split()))
    aa = list(map(int, input().split()))
    res = max(aa) - min(aa)
    ll, rr = [n + 1], [n + 1]
    segments = res_segments = [False] * (m + 1)
    bounds = {0, n, n + 1}
    for _ in range(m):
        l, r = list(map(int, input().split()))
        l -= 1
        ll.append(l)
        rr.append(r)
        bounds.add(l)
        bounds.add(r)
    xlat = sorted(bounds)
    mi, ma = [], []
    for l, r in zip(xlat, xlat[1:-1]):
        t = aa[l:r]
        mi.append(min(t))
        ma.append(max(t))
    bounds = {x: i for i, x in enumerate(xlat)}
    for xx in (ll, rr):
        for i, x in enumerate(xx):
            xx[i] = bounds[x]
    il, ir = (sorted(list(range(m + 1)), key=xx.__getitem__, reverse=True) for xx in (ll, rr))
    for i in range(len(xlat) - 1):
        while True:
            k = il[-1]
            lo = ll[k]
            if lo > i:
                break
            segments[k] = True
            for j in range(lo, rr[k]):
                mi[j] -= 1
                ma[j] -= 1
            del il[-1]

        x = max(ma) - min(mi)
        if res < x:
            res = x
            res_segments = segments[:]
        while True:
            k = ir[-1]
            hi = rr[k]
            if hi > i:
                break
            segments[k] = False
            for j in range(ll[k], hi):
                mi[j] += 1
                ma[j] += 1
            del ir[-1]

    print(res)
    segments = [i for i, f in enumerate(res_segments) if f]
    print(len(segments))
    print(*segments)


def __starting_point():
    main()

__starting_point()

n, m = list(map(int, input().split()))
A = list(map(int, input().split()))
Lf = [[] for _ in range(n)]
Rb = [[] for _ in range(n)]
LR = []
for i in range(m):
    l, r = list(map(int, input().split()))
    l, r = l-1, r-1
    Lf[r].append(l)
    Rb[l].append(r)
    LR.append((l, r))

minus = [0]*n
INF = 10**18
ans = [-INF]*n
mn = A[0]

for i in range(n):
    ans[i] = max(ans[i], A[i]-mn)
    for l in Lf[i]:
        for j in range(l, i+1):
            minus[j] -= 1
            mn = min(mn, A[j]+minus[j])
    mn = min(mn, A[i]+minus[i])

minus = [0]*n
mn = A[n-1]
for i in reversed(list(range(n))):
    ans[i] = max(ans[i], A[i]-mn)
    for r in Rb[i]:
        for j in range(i, r+1):
            minus[j] -= 1
            mn = min(mn, A[j]+minus[j])
    mn = min(mn, A[i]+minus[i])
ans_ = max(ans)
res = []
for i in range(n):
    if ans[i] == ans_:
        for j in range(m):
            l, r = LR[j]
            if not (l <= i and i <= r):
                res.append(j+1)
        break
print(ans_)
print(len(res))
print(*res)