Codefroces Round#427 div2

A. Key races

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Two boys decided to compete in text typing on the site "Key races". During the competition, they have to type a text consisting of s characters. The first participant types one character in v₁ milliseconds and has ping t₁ milliseconds. The second participant types one character in v₂ milliseconds and has ping t₂ milliseconds.

If connection ping (delay) is t milliseconds, the competition passes for a participant as follows:

1. Exactly after t milliseconds after the start of the competition the participant receives the text to be entered.
2. Right after that he starts to type it.
3. Exactly t milliseconds after he ends typing all the text, the site receives information about it.

The winner is the participant whose information on the success comes earlier. If the information comes from both participants at the same time, it is considered that there is a draw.

Given the length of the text and the information about participants, determine the result of the game.

Input

The first line contains five integers s, v₁, v₂, t₁, t₂ (1 ≤ s, v₁, v₂, t₁, t₂ ≤ 1000) — the number of characters in the text, the time of typing one character for the first participant, the time of typing one character for the the second participant, the ping of the first participant and the ping of the second participant.

Output

If the first participant wins, print "First". If the second participant wins, print "Second". In case of a draw print "Friendship".

Examples

Input

5 1 2 1 2

Output

First

Input

3 3 1 1 1

Output

Second

Input

4 5 3 1 5

Output

Friendship

Note

In the first example, information on the success of the first participant comes in 7 milliseconds, of the second participant — in 14 milliseconds. So, the first wins.

In the second example, information on the success of the first participant comes in 11 milliseconds, of the second participant — in 5 milliseconds. So, the second wins.

In the third example, information on the success of the first participant comes in 22 milliseconds, of the second participant — in 22 milliseconds. So, it is be a draw.

水题

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <vector>
#include <queue>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <map>
#include <set>
using namespace std;
#define lowbit(x) (x&(-x))
#define max(x,y) (x>y?x:y)
#define min(x,y) (x<y?x:y)
#define MAX 100000000000000000
#define MOD 1000000007
#define pi acos(-1.0)
#define ei exp(1)
#define PI 3.141592653589793238462
#define ios() ios::sync_with_stdio(false)
#define INF 0x3f3f3f3f3f
#define mem(a) (memset(a,0,sizeof(a)))
typedef long long ll;
int a,b,a1,b1,s;
int main()
{
    cin>>s>>a>>b>>a1>>b1;
    if(a*s+a1*<b*s+b1*) puts("First");
    else if(a*s+a1*>b*s+b1*) puts("Second");
    else puts("Friendship");
    return ;
}

B. The number on the board

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Some natural number was written on the board. Its sum of digits was not less than k. But you were distracted a bit, and someone changed this number to n, replacing some digits with others. It's known that the length of the number didn't change.

You have to find the minimum number of digits in which these two numbers can differ.

Input

The first line contains integer k (1 ≤ k ≤ 10⁹).

The second line contains integer n (1 ≤ n < 10¹⁰⁰⁰⁰⁰).

There are no leading zeros in n. It's guaranteed that this situation is possible.

Output

Print the minimum number of digits in which the initial number and n can differ.

Examples

Input

3
11

Output

1

Input

3
99

Output

0

Note

In the first example, the initial number could be 12.

In the second example the sum of the digits of n is not less than k. The initial number could be equal to n.

保证所有位置上的数之和大于等于K，找差值排序

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <vector>
#include <queue>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <map>
#include <set>
using namespace std;
#define lowbit(x) (x&(-x))
#define max(x,y) (x>y?x:y)
#define min(x,y) (x<y?x:y)
#define MAX 100000000000000000
#define MOD 1000000007
#define pi acos(-1.0)
#define ei exp(1)
#define PI 3.141592653589793238462
#define ios() ios::sync_with_stdio(false)
#define INF 0x3f3f3f3f3f
#define mem(a) (memset(a,0,sizeof(a)))
typedef long long ll;
char a[];
int b[],k;
bool cmp(int x,int y)
{
    return x>y;
}
int main()
{
    cin>>k;
    cin>>a;
    int ans=;
    int len=strlen(a);
    for(int i=;a[i]!='\0';i++)
    {
        ans+=a[i]-'';
        b[i]=-(a[i]-'');
    }
    sort(b,b+len,cmp);
    if(ans>=k) printf("0\n");
    else
    {
        for(int i=;i<len;i++)
        {
            ans+=b[i];
            if(ans>=k){printf("%d\n",i+);return ;}
        }
    }
    return ;
}

C. Star sky

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

The Cartesian coordinate system is set in the sky. There you can see n stars, the i-th has coordinates (x_i, y_i), a maximum brightness c, equal for all stars, and an initial brightness s_i (0 ≤ s_i ≤ c).

Over time the stars twinkle. At moment 0 the i-th star has brightness s_i. Let at moment t some star has brightness x. Then at moment (t + 1) this star will have brightness x + 1, if x + 1 ≤ c, and 0, otherwise.

You want to look at the sky q times. In the i-th time you will look at the moment t_i and you will see a rectangle with sides parallel to the coordinate axes, the lower left corner has coordinates (x_1i, y_1i) and the upper right — (x_2i, y_2i). For each view, you want to know the total brightness of the stars lying in the viewed rectangle.

A star lies in a rectangle if it lies on its border or lies strictly inside it.

Input

The first line contains three integers n, q, c (1 ≤ n, q ≤ 10⁵, 1 ≤ c ≤ 10) — the number of the stars, the number of the views and the maximum brightness of the stars.

The next n lines contain the stars description. The i-th from these lines contains three integers x_i, y_i, s_i (1 ≤ x_i, y_i ≤ 100, 0 ≤ s_i ≤ c ≤ 10) — the coordinates of i-th star and its initial brightness.

The next q lines contain the views description. The i-th from these lines contains five integers t_i, x_1i, y_1i, x_2i, y_2i (0 ≤ t_i ≤ 10⁹, 1 ≤ x_1i < x_2i ≤ 100, 1 ≤ y_1i < y_2i ≤ 100) — the moment of the i-th view and the coordinates of the viewed rectangle.

Output

For each view print the total brightness of the viewed stars.

Examples

Input

2 3 3
1 1 1
3 2 0
2 1 1 2 2
0 2 1 4 5
5 1 1 5 5

Output

3
0
3

Input

3 4 5
1 1 2
2 3 0
3 3 1
0 1 1 100 100
1 2 2 4 4
2 2 1 4 7
1 50 50 51 51

Output

3
3
5
0

Note

Let's consider the first example.

At the first view, you can see only the first star. At moment 2 its brightness is 3, so the answer is 3.

At the second view, you can see only the second star. At moment 0 its brightness is 0, so the answer is 0.

At the third view, you can see both stars. At moment 5 brightness of the first is 2, and brightness of the second is 1, so the answer is 3.

给定n个星星的坐标以及初始亮度，亮度随之时间的增加而增加，但最大值为C，一旦大于C归零从新开始即周期性变化，然后给定一个时间t，和一个矩阵的左上角的坐标和右下角的坐标，问在该时刻矩阵内所有星星的亮度和，最大子矩阵的变形问题

//最大子矩阵和变形
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <vector>
#include <queue>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <map>
#include <set>
using namespace std;
#define lowbit(x) (x&(-x))
#define max(x,y) (x>y?x:y)
#define min(x,y) (x<y?x:y)
#define MAX 100000000000000000
#define MOD 1000000007
#define pi acos(-1.0)
#define ei exp(1)
#define PI 3.141592653589793238462
#define ios() ios::sync_with_stdio(false)
#define INF 0x3f3f3f3f3f
#define mem(a) (memset(a,0,sizeof(a)))
typedef long long ll;
int dp[][][];
int n,q,c,t,x,y,xl,yl,k;
void get_matrix()
{
    for(int i=;i<=;i++)
    {
        for(int j=;j<=;j++)
        {
            for(int k=;k<=;k++)
            {
                dp[i][j][k]+=dp[i-][j][k]+dp[i][j-][k]-dp[i-][j-][k];
            }
        }
    }
}
int get_num(int x,int y,int xx,int yy,int k)
{
    return dp[x][y][k]+dp[xx-][yy-][k]-dp[xx-][y][k]-dp[x][yy-][k];
}
int main()
{
    scanf("%d%d%d",&n,&q,&c);
    memset(dp,,sizeof(dp));
    for(int i=;i<n;i++)
    {
        scanf("%d%d%d",&x,&y,&k);
        dp[x][y][k]++;
    }
    get_matrix();
    while(q--)
    {
        int ans=;
        scanf("%d%d%d%d%d",&t,&x,&y,&xl,&yl);
        for(int i=;i<=;i++)
        {
            int val=(t+i)%(c+);
            ans+=val*get_num(xl,yl,x,y,i);
        }
        printf("%d\n",ans);
    }
    return ;
}