Codeforces Round #401 (Div. 2)

A. Shell Game

Bomboslav likes to look out of the window in his room and watch lads outside playing famous shell game. The game is played by two persons: operator and player. Operator takes three similar opaque shells and places a ball beneath one of them. Then he shuffles the shells by swapping some pairs and the player has to guess the current position of the ball.

Bomboslav noticed that guys are not very inventive, so the operator always swaps the left shell with the middle one during odd moves (first, third, fifth, etc.) and always swaps the middle shell with the right one during even moves (second, fourth, etc.).

Let's number shells from 0 to 2 from left to right. Thus the left shell is assigned number 0, the middle shell is 1 and the right shell is2. Bomboslav has missed the moment when the ball was placed beneath the shell, but he knows that exactlyn movements were made by the operator and the ball was under shellx at the end. Now he wonders, what was the initial position of the ball?

Input

The first line of the input contains an integer n (1 ≤ n ≤ 2·10⁹) — the number of movements made by the operator.

The second line contains a single integer x (0 ≤ x ≤ 2) — the index of the shell where the ball was found aftern movements.

Output

Print one integer from 0 to 2 — the index of the shell where the ball was initially placed.

Examples

Input

4
2

Output

1

Input

1
1

Output

0

这题找规律即可

#include <iostream>
#include<bits/stdc++.h>

using namespace std;

int a[3][6]={0,1,2,2,1,0,1,0,0,1,2,2,2,2,1,0,0,1};
__int64 n;
int x;
int main()
{
    while(~scanf("%I64d%d",&n,&x))
    {
        n%=6;
        for(int i=0;i<3;i++)
            if(a[i][n]==x)
                printf("%d\n",i);
    }
}

B. Game of Credit Cards

After the fourth season Sherlock and Moriary have realized the whole foolishness of the battle between them and decided to continue their competitions in peaceful game of Credit Cards.

Rules of this game are simple: each player bring his favourite n-digit credit card. Then both players name the digits written on their cards one by one. If two digits are not equal, then the player, whose digit is smaller gets a flick (knock in the forehead usually made with a forefinger) from the other player. For example, if n = 3, Sherlock's card is123 and Moriarty's card has number321, first Sherlock names 1 and Moriarty names3 so Sherlock gets a flick. Then they both digit2 so no one gets a flick. Finally, Sherlock names 3, while Moriarty names1 and gets a flick.

Of course, Sherlock will play honestly naming digits one by one in the order they are given, while Moriary, as a true villain, plans to cheat. He is going to name his digits in some other order (however, he is not going to change the overall number of occurences of each digit). For example, in case above Moriarty could name 1, 2, 3 and get no flicks at all, or he can name2,3 and 1 to give Sherlock two flicks.

Your goal is to find out the minimum possible number of flicks Moriarty will get (no one likes flicks) and the maximum possible number of flicks Sherlock can get from Moriarty. Note, that these two goals are different and the optimal result may be obtained by using different strategies.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 1000) — the number of digits in the cards Sherlock and Moriarty are going to use.

The second line contains n digits — Sherlock's credit card number.

The third line contains n digits — Moriarty's credit card number.

Output

First print the minimum possible number of flicks Moriarty will get. Then print the maximum possible number of flicks that Sherlock can get from Moriarty.

Examples

Input

3
123
321

Output

0
2

Input

2
88
00

Output

2
0

Note

First sample is elaborated in the problem statement. In the second sample, there is no way Moriarty can avoid getting two flicks.

田忌赛马......先对Moriaty的数排序。如果想最少被弹，对每个Sherlock的数取大于等于它的最小数，如果不存在大于等于它的数就取最小的（下等马对上等马）。

同样，想多弹Sherlock则用类似的策略，将取大于等于的数改为取大于的数。

#include <iostream>
#include<bits/stdc++.h>

using namespace std;
const int N=1100;

int n,v[N];
char a[N],b[N];
int main()
{
    while(~scanf("%d",&n))
    {
        getchar();
        for(int i=0;i<n;i++)    scanf("%c",&a[i]);
        getchar();
        for(int i=0;i<n;i++)    scanf("%c",&b[i]);
        sort(b,b+n);
        memset(v,0,sizeof(v));
        int ans1=0,ans2=0;
        for(int i=0;i<n;i++)
        {
            int flag=0;
            for(int j=0;j<n&&flag==0;j++)
            {
                if(!v[j]&&b[j]>=a[i])
                {
                    v[j]=1;
                    flag=1;
                    break;
                }
            }
            if(flag==0)
            {
                for(int j=0;j<n;j++)
                {
                    if(v[j]==0)
                    {
                        v[j]=1;
                        ans1++;
                        break;
                    }
                }
            }
        }
        memset(v,0,sizeof(v));
        for(int i=0;i<n;i++)
        {
            int flag=0;
            for(int j=0;j<n&&flag==0;j++)
            {
                if(!v[j]&&b[j]>a[i])
                {
                    v[j]=1;
                    flag=1;
                    ans2++;
                    break;
                }
            }
            if(flag==0)
            {
                for(int j=0;j<n;j++)
                {
                    if(v[j]==0)
                    {
                        v[j]=1;
                        break;
                    }
                }
            }
        }
        printf("%d\n%d\n",ans1,ans2);
    }
}

C. Alyona and Spreadsheet

During the lesson small girl Alyona works with one famous spreadsheet computer program and learns how to edit tables.

Now she has a table filled with integers. The table consists of n rows and m columns. By a_i, j we will denote the integer located at thei-th row and the j-th column. We say that the table is sorted in non-decreasing order in the columnj ifa_i, j ≤ a_{i + 1, j} for all i from 1 ton - 1.

Teacher gave Alyona k tasks. For each of the tasks two integersl andr are given and Alyona has to answer the following question: if one keeps the rows froml tor inclusive and deletes all others, will the table be sorted in non-decreasing order in at least one column? Formally, does there exist suchj thata_i, j ≤ a_{i + 1, j} for all i from l tor - 1 inclusive.

Alyona is too small to deal with this task and asks you to help!

Input

The first line of the input contains two positive integers n and m (1 ≤ n·m ≤ 100 000) — the number of rows and the number of columns in the table respectively. Note that your are given a constraint that bound the product of these two integers, i.e. the number of elements in the table.

Each of the following n lines contains m integers. The j-th integers in thei of these lines stands fora_i, j (1 ≤ a_i, j ≤ 10⁹).

The next line of the input contains an integer k (1 ≤ k ≤ 100 000) — the number of task that teacher gave to Alyona.

The i-th of the next k lines contains two integers l_i andr_i (1 ≤ l_i ≤ r_i ≤ n).

Output

Print "Yes" to the i-th line of the output if the table consisting of rows from l_i tor_i inclusive is sorted in non-decreasing order in at least one column. Otherwise, print "No".

Example

Input

5 4
1 2 3 5
3 1 3 2
4 5 2 3
5 5 3 2
4 4 3 4
6
1 1
2 5
4 5
3 5
1 3
1 5

Output

Yes
No
Yes
Yes
Yes
No

Note

In the sample, the whole table is not sorted in any column. However, rows 1–3 are sorted in column1, while rows 4–5 are sorted in column3.

数据范围看起来挺大的，刚开始想的比较复杂，询问合并之类的。搞了半天，最后想想直接预处理后判断就行了，蠢了。。。预处理每行最多能向上（不严格）递减到第几行

#include <iostream>
#include<bits/stdc++.h>

using namespace std;
const int N=110000;
int a[2][N],b[2][N],bb[N],n,m;

int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        memset(a[0],0x7ffffff,sizeof(a[0]));
        for(int i=1;i<=n;i++)
        {
            bb[i]=i;
            for(int j=1;j<=m;j++)
            {
                int t=i%2;
                scanf("%d",&a[t][j]);
                if(a[t][j]>=a[t^1][j])  b[t][j]=b[t^1][j];
                else    b[t][j]=i;
                bb[i]=min(bb[i],b[t][j]);
            }
        }
        int q;
        scanf("%d",&q);
        for(int i=0;i<q;i++)
        {
            int l,r;
            scanf("%d%d",&l,&r);
            if(bb[r]<=l)    printf("Yes\n");
            else    printf("No\n");
        }
    }
}

由于第三题浪费了大量时间，第四题没时间看T.T

假期回来的第一场比赛，不管是思维还是手速都没跟上节奏，无情掉分。。。